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 should_we_balance.A_thread_variables_properties.A_thread_variables_properties.
Require Import should_we_balance.Compound.Compound.
Open Scope Z_scope.
Theorem goal3 (a : addr) (a_1 : addr) (t_3 : addr -> addr) (i : Z) (t_1 : addr -> Z) (t_2 : addr -> Z) (i_1 : Z) (t : Z -> Z) : let a_2 : addr := shift a 0%Z in let a_3 : addr := shift a_1 0%Z in let a_4 : addr := t_3 a_2 in let a_5 : addr := shift a_4 0%Z in let a_6 : addr := shift a_4 i in let a_7 : addr := t_3 a_3 in let a_8 : addr := shift a_7 0%Z in let a_9 : addr := shift a_7 i in let a_10 : addr -> Z := havoc t_1 t_2 a_8 l_size in let a_11 : Z := a_10 a_6 in let a_12 : addr -> Z := fun_updt a_10 a_9 a_11 in ¬ to_uint32 i = l_size -> 0%Z ≤ i -> i_1 ≤ i -> 0%Z ≤ i_1 -> i ≤ l_size -> region (base a) ≤ 0%Z -> region (base a_1) ≤ 0%Z -> i ≤ 2147483646%Z -> framed t_3 -> linked t -> is_sint32 i -> valid_rd t a 1%Z -> valid_rd t a_1 1%Z -> is_sint32 (1%Z + i) -> valid_rd t a_2 1%Z -> valid_rd t a_3 1%Z -> valid_rd t a_5 l_size -> valid_rd t a_6 1%Z -> valid_rw t a_8 l_size -> valid_rw t a_9 1%Z -> separated a_8 l_size a_5 l_size -> is_uint8 a_11 -> a_11 = 0%Z ∨ a_11 = 1%Z -> (∀(i_2 : Z), 0%Z ≤ i_2 -> i_2 < i -> (¬ a_10 (shift a_7 i_2) = 0%Z) = (¬ a_10 (shift a_4 i_2) = 0%Z)) -> (¬ a_12 (shift a_7 i_1) = 0%Z) = (¬ a_12 (shift a_4 i_1) = 0%Z).
Admitted.
