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.
Theorem goal0 (a_1 : addr) (a : addr) (i_9 : Z) (i_12 : Z) (i_7 : Z) (i_17 : Z) (i_8 : Z) (t : Z -> Z) (i_1 : Z) (i_2 : Z) (i_13 : Z) (i_14 : Z) (i : Z) (i_3 : Z) (i_4 : Z) (i_5 : Z) (i_6 : Z) (i_10 : Z) (i_11 : Z) (i_15 : Z) (i_16 : Z) (p : bool) (p_1 : bool) (p_2 : bool) : let x : Z := base a_1 in let x_1 : Z := base a in let x_2 : Z := i_9 + i_12 in let a_2 : addr := shift a_1 i_9 in let x_4 : Z := 2147483647%Z + i_7 in let x_5 : Z := 2147483647%Z + i_17 in let a_3 : addr := shift a_1 (i_7 + i_9) in ¬ i_8 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_1 -> ¬ x = x_1 -> 0%Z ≤ i_8 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> linked t -> is_uint16 i_1 -> is_uint16 i_2 -> is_uint16 i_7 -> is_uint16 i_8 -> is_uint16 i_9 -> is_uint16 i_12 -> is_uint16 i_13 -> is_uint16 i_14 -> is_uint16 i_17 -> is_sint32 i -> is_sint32 i_3 -> is_sint32 i_4 -> is_sint32 i_5 -> is_sint32 i_6 -> is_sint32 i_10 -> is_sint32 i_11 -> is_sint32 i_15 -> is_sint32 i_16 -> (if decide (i_3 = 0%Z) then to_uint16 (i_8 - i_9) = i_1 ∧ 0%Z ≤ i_12 ∧ - 2147483648%Z ≤ x_2 ∧ x_2 ≤ 2147483647%Z ∧ i_8 ≤ 2147483647%Z + i_9 ∧ i_9 ≤ 2147483648%Z + i_8 ∧ (if decide (i_4 = 0%Z) then (if decide (i_10 = 0%Z) then if decide (i_7 = 10%Z) then valid_rd t a_2 10%Z ∧ (if decide (i_16 = 0%Z) then i_11 = 1%Z else i_11 = 0%Z) else i_11 = 0%Z else i_11 = i_10) ∧ (if decide (i_7 = 10%Z) then p = true ∧ p_1 = true ∧ p_2 = true ∧ valid_rd t a_2 10%Z ∧ (if decide (i_15 = 0%Z) then i_10 = 1%Z else i_10 = 0%Z) else p = true ∧ p_1 = true ∧ p_2 = true ∧ i_10 = 0%Z) ∧ (if decide (i_11 = 0%Z) then p = true ∧ p_1 = true ∧ p_2 = true ∧ i_6 = - 4818%Z else p = true ∧ p_1 = true ∧ p_2 = true ∧ to_uint16 (i_1 - i_7) = i_2 ∧ to_uint16 (i_12 - i_7) = i_13 ∧ i_1 ≤ x_4 ∧ i_7 ≤ 2147483648%Z + i_1 ∧ i_7 ≤ 2147483648%Z + i_12 ∧ i_12 ≤ x_4 ∧ (if decide (i_5 = 0%Z) then to_uint16 (i_13 - i_17) = i_14 ∧ i_2 ≤ x_5 ∧ i_13 ≤ x_5 ∧ i_17 ≤ 2147483648%Z + i_2 ∧ i_17 ≤ 2147483648%Z + i_13 ∧ (if decide (i_14 = 0%Z) then i_6 = 0%Z ∧ valid_rw t a 1%Z else i_6 = - 4845%Z) else i_6 = i_5) ∧ (i_13 = 0%Z -> i_5 < 0%Z) ∧ (i_5 = 0%Z -> 0%Z ≤ i ∧ i ≤ 1%Z) ∧ (i_5 = 0%Z -> i_17 ≤ i_13 ∧ 2%Z ≤ i_17) ∧ (a_3 = Mk_addr 0%Z 0%Z -> i_5 < 0%Z) ∧ (¬ a_3 = Mk_addr 0%Z 0%Z -> 0%Z < i_13 -> valid_rd t a_3 i_13) ∧ (i_5 = 0%Z ∨ i_5 < 0%Z)) else i_6 = i_4) ∧ (i_12 = 0%Z -> i_4 < 0%Z) ∧ (a_2 = Mk_addr 0%Z 0%Z -> i_4 < 0%Z) ∧ (i_4 = 0%Z -> i_7 ≤ i_12 ∧ 3%Z ≤ i_7) ∧ (¬ a_2 = Mk_addr 0%Z 0%Z -> 0%Z < i_12 -> valid_rd t a_2 i_12) ∧ (i_4 = 0%Z ∨ i_4 < 0%Z) else i_6 = i_3) -> (i_3 = 0%Z -> i_12 ≤ i_8) -> (i_3 = 0%Z -> x_2 ≤ i_8) -> (i_3 = 0%Z -> i_9 ≤ i_8 ∧ 2%Z ≤ i_9) -> (0%Z < i_8 -> valid_rd t (shift a_1 0%Z) i_8) -> i_3 = 0%Z ∨ i_3 < 0%Z -> i_6 = 0%Z ∨ i_6 < 0%Z.
Admitted.
