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 contiki_list.Compound.Compound.
Require Import contiki_list.S1_list.S1_list.
Require Import contiki_list.Axiomatic.Axiomatic.
Open Scope Z_scope.
Theorem goal38 (a_2 : addr) (t_2 : addr -> addr) (a_1 : addr) (t_3 : addr -> addr) (t : Z -> Z) (i : Z) (t_4 : addr -> addr) (a : addr) (t_1 : Z -> Z) : let a_3 : addr := shift a_2 0%Z in let a_4 : addr := t_2 a_1 in let a_5 : addr := t_3 a_1 in let a_6 : addr := shift a_5 0%Z in let a_7 : addr := t_3 a_6 in region (base a_1) ≤ 0%Z -> region (base a_2) ≤ 0%Z -> framed t_2 -> linked t -> is_sint32 i -> valid_rd t a_1 1%Z -> valid_rw t a_1 1%Z -> valid_rw t a_3 2147483646%Z -> separated a_1 1%Z a_3 2147483646%Z -> separated a_4 4%Z a_3 2147483646%Z -> p_linked_n t t_2 a_4 a_2 i 1%Z (Mk_addr 0%Z 0%Z) -> (if decide (a_4 = Mk_addr 0%Z 0%Z) then t_4 = t_2 ∧ t_4 a_1 = a else t_3 = t_2 ∧ t_1 = t ∧ a_5 = a ∧ a_7 = Mk_addr 0%Z 0%Z ∧ fun_updt t_3 a_1 a_7 = t_4 ∧ valid_rd t_1 a_1 1%Z ∧ valid_rw t_1 a_1 1%Z ∧ valid_rd t_1 a_6 1%Z) -> (∀(i_1 : Z), i ≤ i_1 -> i_1 ≤ i -> separated a_1 1%Z (t_2 (shift a_2 i_1)) 4%Z) -> (∀(i_1 : Z), i ≤ i_1 -> i_1 ≤ i -> separated (t_2 (shift a_2 i_1)) 4%Z a_3 2147483646%Z) -> (∀(i_2 : Z) (i_1 : Z), ¬ i_2 = i_1 -> i ≤ i_1 -> i ≤ i_2 -> i_1 ≤ i -> i_2 ≤ i -> ¬ t_2 (shift a_2 i_2) = t_2 (shift a_2 i_1)) -> (∀(i_2 : Z) (i_1 : Z), ¬ i_2 = i_1 -> i ≤ i_1 -> i ≤ i_2 -> i_1 ≤ i -> i_2 ≤ i -> separated (t_2 (shift a_2 i_2)) 4%Z (t_2 (shift a_2 i_1)) 4%Z) -> t_4 (shift a_2 i) = a.
Admitted.
