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 goal0 (a_1 : addr) (a : addr) (i_1 : Z) (i_16 : Z) (i_17 : Z) (i_4 : Z) (i_19 : Z) (i_14 : Z) (i_18 : Z) (i_15 : Z) (i_12 : Z) (t : Z -> Z) (i : Z) (i_2 : Z) (i_3 : Z) (i_5 : Z) (i_13 : Z) (i_6 : Z) (i_7 : Z) (i_8 : Z) (i_9 : Z) (i_10 : Z) (i_11 : Z) (i_20 : Z) : let x : Z := base a_1 in let x_1 : Z := base a in let x_2 : Z := to_uint16 (i_1 - i_16) in let x_4 : Z := 2147483647%Z + i_17 in let x_5 : Z := to_uint16 (i_4 - i_19) in let x_6 : Z := 2147483647%Z + i_19 in let x_7 : Z := 2147483648%Z + i_4 in let a_2 : addr := shift a 10%Z in let a_3 : addr := shift a_1 (i_14 + i_16 + i_17 + i_18) in let x_8 : Z := i_17 + i_19 in let a_4 : addr := shift a_1 (i_14 + i_16 + i_18) in let a_5 : addr := shift a_1 (i_14 + i_15) in let a_6 : addr := shift a_1 (i_14 + i_17) in let a_7 : addr := shift a_1 i_14 in ¬ i_12 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_1 -> ¬ x = x_1 -> 0%Z ≤ i_12 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> 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_12 -> is_uint16 i_13 -> is_uint16 i_15 -> is_uint16 i_17 -> is_uint16 i_18 -> is_uint16 i_19 -> is_sint32 i_6 -> is_sint32 i_7 -> is_sint32 i_8 -> is_sint32 i_9 -> is_sint32 i_10 -> is_sint32 i_11 -> is_sint32 i_20 -> valid_rw t a 15%Z -> (if decide (i_20 = 0%Z) then i_9 = - 6867%Z else (if decide (i_6 = 0%Z) then if decide (i = 0%Z) then i_9 = - 6887%Z else i_14 = i_13 ∧ 0%Z ≤ i ∧ (if decide (i_7 = 0%Z) then i_1 = i ∧ i_10 ≤ 0%Z ∧ 0%Z ≤ i_18 ∧ i_1 ≤ 2147483647%Z + i_15 ∧ i_15 ≤ 2147483648%Z + i_1 ∧ (if decide (i_10 = 0%Z) then i_16 = i_15 ∧ to_uint16 (x_2 - i_18) = i_2 ∧ x_2 ≤ 2147483647%Z + i_18 ∧ i_18 ≤ 2147483648%Z + x_2 ∧ (if decide (i_8 = 0%Z) then i_3 = i_2 ∧ to_uint16 (i_2 - i_17) = i_4 ∧ i_11 ≤ 0%Z ∧ 0%Z ≤ i_19 ∧ i_2 ≤ x_4 ∧ i_17 ≤ 2147483648%Z + i_2 ∧ (if decide (i_11 = 0%Z) then x_5 = i_5 ∧ i_4 ≤ x_6 ∧ i_19 ≤ x_7 ∧ (if decide (i_5 = 0%Z) then i_9 = 0%Z ∧ valid_rw t a_2 1%Z else i_9 = - 6927%Z) else i_11 = i_9) ∧ (i_19 = 0%Z -> i_11 < 0%Z) ∧ (a_3 = Mk_addr 0%Z 0%Z -> i_11 < 0%Z) ∧ (¬ a_3 = Mk_addr 0%Z 0%Z -> 0%Z < i_19 -> valid_rd t a_3 i_19) else i_5 = i_2 ∧ (if decide (i_2 = 0%Z) then i_9 = 0%Z ∧ valid_rw t a_2 1%Z else i_9 = - 6927%Z)) ∧ (i_2 = 0%Z -> i_8 < 0%Z) ∧ (i_8 = 0%Z -> i_19 ≤ i_2) ∧ (i_8 = 0%Z -> x_8 ≤ i_2) ∧ (i_8 = 0%Z -> i_17 ≤ i_2 ∧ 2%Z ≤ i_17) ∧ (a_4 = Mk_addr 0%Z 0%Z -> i_8 < 0%Z) ∧ (¬ a_4 = Mk_addr 0%Z 0%Z -> 0%Z < i_2 -> valid_rd t a_4 i_2) ∧ (i_8 = 0%Z ∨ i_8 < 0%Z) else i_10 = i_9) ∧ (i_18 = 0%Z -> i_10 < 0%Z) ∧ (a_5 = Mk_addr 0%Z 0%Z -> i_10 < 0%Z) ∧ (¬ a_5 = Mk_addr 0%Z 0%Z -> 0%Z < i_18 -> valid_rd t a_5 i_18) else i_2 = i ∧ i_16 = i_15 ∧ 0%Z ≤ i_2 ∧ (if decide (i_8 = 0%Z) then i_3 = i_2 ∧ to_uint16 (i_3 - i_17) = i_4 ∧ i_11 ≤ 0%Z ∧ 0%Z ≤ i_19 ∧ i_3 ≤ x_4 ∧ i_17 ≤ 2147483648%Z + i_3 ∧ (if decide (i_11 = 0%Z) then x_5 = i_5 ∧ i_4 ≤ x_6 ∧ i_19 ≤ x_7 ∧ (if decide (i_5 = 0%Z) then i_9 = 0%Z ∧ valid_rw t a_2 1%Z else i_9 = - 6927%Z) else i_11 = i_9) ∧ (i_19 = 0%Z -> i_11 < 0%Z) ∧ (a_6 = Mk_addr 0%Z 0%Z -> i_11 < 0%Z) ∧ (¬ a_6 = Mk_addr 0%Z 0%Z -> 0%Z < i_19 -> valid_rd t a_6 i_19) else i_5 = i_2 ∧ (if decide (i_5 = 0%Z) then i_9 = 0%Z ∧ valid_rw t a_2 1%Z else i_9 = - 6927%Z)) ∧ (i_2 = 0%Z -> i_8 < 0%Z) ∧ (i_8 = 0%Z -> i_19 ≤ i_2) ∧ (a_7 = Mk_addr 0%Z 0%Z -> i_8 < 0%Z) ∧ (i_8 = 0%Z -> x_8 ≤ i_2) ∧ (i_8 = 0%Z -> i_17 ≤ i_2 ∧ 2%Z ≤ i_17) ∧ (¬ a_7 = Mk_addr 0%Z 0%Z -> 0%Z < i_2 -> valid_rd t a_7 i_2) ∧ (i_8 = 0%Z ∨ i_8 < 0%Z)) ∧ (i_7 = 0%Z -> i_18 ≤ i) ∧ (a_7 = Mk_addr 0%Z 0%Z -> i_7 < 0%Z) ∧ (i_7 = 0%Z -> i_15 + i_18 ≤ i) ∧ (i_7 = 0%Z -> i_15 ≤ i ∧ 2%Z ≤ i_15) ∧ (¬ a_7 = Mk_addr 0%Z 0%Z -> 0%Z < i -> valid_rd t a_7 i) ∧ (i_7 = 0%Z ∨ i_7 < 0%Z) else i_9 = i_6) ∧ (i_6 = 0%Z -> i ≤ i_12) ∧ (i_6 = 0%Z -> i + i_13 ≤ i_12) ∧ (i_6 = 0%Z -> i_13 ≤ i_12 ∧ 2%Z ≤ i_13) ∧ (i_6 = 0%Z ∨ i_6 < 0%Z)) -> (0%Z < i_12 -> valid_rd t (shift a_1 0%Z) i_12) -> i_9 = 0%Z ∨ i_9 < 0%Z.
Admitted.
