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.
Lemma goal0 (a_3 : addr) (a_1 : addr) (i_6 : Z) (i_7 : Z) (a_2 : addr) (a : addr) (i_5 : Z) (t_1 : addr -> addr) (t : Z -> Z) (i : Z) (i_4 : Z) (i_1 : Z) (i_2 : Z) (i_3 : Z) (i_8 : Z) : let x : Z := base a_3 in let x_1 : Z := base a_1 in let x_2 : Z := i_6 + i_7 in let a_4 : addr := shift a_2 0%Z in let a_5 : addr := shift a 0%Z in ¬ i_5 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_3 -> ¬ x = x_1 -> 0%Z ≤ i_5 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> framed t_1 -> linked t -> is_uint16 i -> is_uint16 i_4 -> is_uint16 i_5 -> is_uint16 i_6 -> is_uint16 i_7 -> is_sint32 i_1 -> is_sint32 i_2 -> is_sint32 i_3 -> is_sint32 i_8 -> valid_rw t a_1 15%Z -> (if decide (i_1 = 0%Z) then if decide (i_7 = 0%Z) then i_2 = - 7190%Z else - 2147483648%Z ≤ x_2 ∧ x_2 ≤ 2147483647%Z ∧ (if decide (x_2 = i_5) then valid_rd t a_4 i ∧ (if decide (i = 0%Z) then i_2 = 0%Z else 0%Z ≤ i ∧ (if decide (i_3 = 0%Z) then 0%Z ≤ i_4 ∧ (if decide (Mk_addr 0%Z 0%Z = a) then i_2 = - 7219%Z else i_2 = - 7230%Z ∧ ¬ i_8 = 0%Z ∧ t_1 a_5 = shift (Mk_addr (- 4240%Z) 0%Z) 0%Z ∧ valid_rd t a_5 1%Z) ∧ (i_4 = 0%Z -> Mk_addr 0%Z 0%Z = a) ∧ (Mk_addr 0%Z 0%Z = a_2 -> Mk_addr 0%Z 0%Z = a) ∧ (¬ Mk_addr 0%Z 0%Z = a_2 -> 0%Z < i_4 -> valid_rd t a_4 i_4) ∧ (¬ Mk_addr 0%Z 0%Z = a -> (∃(i_9 : Z), shift___anonstruct__kp_oid_13 (Mk_addr (- 4247%Z) 0%Z) i_9 = a ∧ 0%Z ≤ i_9 ∧ i_9 ≤ 6%Z)) else i_3 = i_2) ∧ (Mk_addr 0%Z 0%Z = a_2 -> i_3 < 0%Z) ∧ (i_3 = 0%Z -> i_4 ≤ i ∧ 3%Z ≤ i_4) ∧ (i_3 = 0%Z ∨ i_3 < 0%Z)) else i_2 = - 7199%Z) else i_2 = - 7190%Z) -> (i_1 = 0%Z -> i_7 ≤ i_5) -> (i_1 = 0%Z -> x_2 ≤ i_5) -> (i_1 = 0%Z -> i_6 ≤ i_5 ∧ 2%Z ≤ i_6) -> (0%Z < i_5 -> valid_rd t (shift a_3 0%Z) i_5) -> i_1 = 0%Z ∨ i_1 < 0%Z -> i_2 ≤ 0%Z.
Admitted.
