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.
Open Scope Z_scope.
Lemma goal9 (a_2 : addr) (a : addr) (a_1 : addr) (i_11 : Z) (i_9 : Z) (i_10 : Z) (i : Z) (i_8 : Z) (i_14 : Z) (i_3 : Z) (t : Z -> Z) (i_1 : Z) (i_2 : Z) (i_4 : Z) (i_5 : Z) (i_12 : Z) (i_13 : Z) (i_6 : Z) (i_7 : Z) : let x : Z := base a_2 in let x_1 : Z := base a in let a_3 : addr := shift a_1 i_11 in let a_4 : addr := shift a_2 (i_9 + i_10) in let a_5 : addr := shift a_2 i_9 in ¬ i = 0%Z -> ¬ i_8 = 0%Z -> ¬ i_14 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_2 -> ¬ x = x_1 -> 0%Z ≤ i -> 0%Z ≤ i_3 -> 0%Z ≤ i_8 -> i ≤ i_8 -> i_9 ≤ i_8 -> i + i_9 ≤ i_8 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> 2%Z ≤ i_9 -> linked t -> is_uint16 i -> is_uint16 i_1 -> is_uint16 i_2 -> is_uint16 i_3 -> is_uint16 i_4 -> is_uint16 i_5 -> is_uint16 i_8 -> is_uint16 i_9 -> is_uint16 i_10 -> is_uint16 i_11 -> is_uint16 i_12 -> is_uint16 i_13 -> is_sint32 i_6 -> is_sint32 i_7 -> is_sint32 i_14 -> valid_rw t a 15%Z -> (if decide (i_7 = 0%Z) then i_4 = i_3 ∧ ¬ i_13 = 0%Z ∧ ¬ a_3 = Mk_addr 0%Z 0%Z ∧ to_uint16 (i_4 - i_11) = i_5 ∧ to_uint16 (i_5 - i_13) = 0%Z ∧ 0%Z ≤ i_13 ∧ i_4 ≤ 2147483647%Z + i_11 ∧ i_5 ≤ 2147483647%Z + i_13 ∧ i_11 ≤ 2147483648%Z + i_4 ∧ i_13 ≤ 2147483648%Z + i_5 ∧ (0%Z < i_13 -> valid_rd t a_3 i_13) else i_3 = 0%Z) -> (if decide (i_6 = 0%Z) then i_1 = i ∧ ¬ i_12 = 0%Z ∧ ¬ a_4 = Mk_addr 0%Z 0%Z ∧ to_uint16 (i_1 - i_10) = i_2 ∧ to_uint16 (i_2 - i_12) = i_3 ∧ shift a_2 (i_9 + i_10 + i_12) = a_1 ∧ 0%Z ≤ i_12 ∧ i_1 ≤ 2147483647%Z + i_10 ∧ i_2 ≤ 2147483647%Z + i_12 ∧ i_10 ≤ 2147483648%Z + i_1 ∧ i_12 ≤ 2147483648%Z + i_2 ∧ (0%Z < i_12 -> valid_rd t a_4 i_12) else i_3 = i ∧ a_5 = a_1) -> (i_3 = 0%Z -> i_7 < 0%Z) -> (Mk_addr 0%Z 0%Z = a_1 -> i_7 < 0%Z) -> (i_6 = 0%Z -> i_12 ≤ i) -> (i_7 = 0%Z -> i_13 ≤ i_3) -> (a_5 = Mk_addr 0%Z 0%Z -> i_6 < 0%Z) -> (i_6 = 0%Z -> i_10 + i_12 ≤ i) -> (i_7 = 0%Z -> i_11 + i_13 ≤ i_3) -> (i_6 = 0%Z -> i_10 ≤ i ∧ 2%Z ≤ i_10) -> (i_7 = 0%Z -> i_11 ≤ i_3 ∧ 2%Z ≤ i_11) -> (0%Z < i_8 -> valid_rd t (shift a_2 0%Z) i_8) -> (¬ Mk_addr 0%Z 0%Z = a_1 -> 0%Z < i_3 -> valid_rd t (shift a_1 0%Z) i_3) -> (¬ a_5 = Mk_addr 0%Z 0%Z -> 0%Z < i -> valid_rd t a_5 i) -> i_6 = 0%Z ∨ i_6 < 0%Z -> i_7 = 0%Z ∨ i_7 < 0%Z -> valid_rw t (shift a 10%Z) 1%Z.
Admitted.
