From Stdlib Require Import Strings.String.
From Stdlib Require Import String Ascii.
From Stdlib Require Arith.
From stdpp Require Import base.
From stdpp Require Import fin_maps.
From stdpp Require Import gmap.
From stdpp Require Import base gmultiset.
From Stdlib Require Classical.
From Stdlib Require Import ZArith.
From stdpp.bitvector Require Import definitions tactics.
From Stdlib Require Import Sorting.Sorted.
From Stdlib Require Import Reals.Rbasic_fun.
From Stdlib Require Import Reals.Abstract.ConstructiveAbs.
From Stdlib Require Import Reals.Rdefinitions.
From stdpp Require Import list_relations.
From stdpp Require Import list_numbers.
From stdpp Require Import functions.
From Stdlib Require Import ClassicalEpsilon.
From stdpp Require Import base decidable.
From Stdlib Require Import ZArith.Zeuclid.
From Stdlib Require Import ZArith.Znumtheory.
From stdpp Require Import propset.
From Stdlib Require Import Reals.
Require Import Why3.Base.
Require Import Why3.Qed.Qed.
Require Import Why3.Memory.Memory.
Require Import Why3.Cint.Cint.
Require Import x509_parser.Compound.Compound.
Require Import x509_parser.Globals.Globals.
Open Scope Z_scope.
Theorem goal1 (a_3 : addr) (i_4 : Z) (i_3 : Z) (i_5 : Z) (t_2 : addr -> Z) (a_1 : addr) (i : Z) (a_2 : addr) (i_1 : Z) (i_2 : Z) (t_1 : Z -> Z) (t : Z -> Z) : let a_4 : addr := shift a_3 i_4 in let a_5 : addr := shift___anonstruct__name_oid_11 (Mk_addr (- 4206%Z) 0%Z) i_3 in let x : Z := i_4 + i_5 in let x_1 : Z := fun_updt t_2 a_1 i a_2 in ¬ i_1 = 0%Z -> ¬ i_2 = 0%Z -> ¬ i_5 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_3 -> ¬ a_4 = Mk_addr 0%Z 0%Z -> ¬ a_5 = Mk_addr 0%Z 0%Z -> 0%Z ≤ i_1 -> 0%Z ≤ i_2 -> i_4 ≤ i_2 -> i_5 ≤ i_2 -> 0%Z ≤ i_3 -> 0%Z ≤ i_5 -> i_1 ≤ i_5 -> x ≤ i_2 -> region (base a_2) ≤ 0%Z -> region (base a_3) ≤ 0%Z -> 2%Z ≤ i_4 -> 3%Z ≤ i_1 -> i_3 ≤ 15%Z -> - 2147483648%Z ≤ x -> x ≤ 2147483647%Z -> i_1 ≤ 2147483648%Z + i_5 -> i_2 ≤ 2147483647%Z + i_4 -> i_4 ≤ 2147483648%Z + i_2 -> i_5 ≤ 2147483647%Z + i_1 -> linked t_1 -> is_uint16 i_1 -> is_uint16 i_2 -> is_uint16 i_4 -> is_uint16 i_5 -> valid_rw t a_1 1%Z -> valid_rw t_1 a_2 1%Z -> is_uint16 x_1 -> valid_rd t_1 (shift a_5 2%Z) 1%Z -> (0%Z < i_2 -> valid_rd t_1 (shift a_3 0%Z) i_2) -> (0%Z < i_1 -> valid_rd t_1 a_4 i_1) -> (0%Z < i_5 -> valid_rd t_1 a_4 i_5) -> x_1 ≤ i_2 ∧ 2%Z ≤ x_1.
Admitted.
