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 klibc_stdio.Compound.Compound.
Require Import Why3.Cint.Cint.
Require Import klibc_stdio.Axiomatic3.Axiomatic3.
Open Scope Z_scope.
Theorem goal131 (a_3 : addr) (t_1 : addr -> Z) (a_1 : addr) (a : addr) (t_4 : addr -> addr) (t_2 : addr -> Z) (t_3 : addr -> Z) (i_6 : Z) (a_2 : addr) (i_4 : Z) (i_7 : Z) (i_3 : Z) (t : Z -> Z) (i_5 : Z) (i : Z) (i_1 : Z) (i_2 : Z) : let x : Z := base a_3 in let x_1 : Z := t_1 (shift a_1 7%Z) in let x_2 : Z := t_1 (shift a_1 9%Z) in let a_4 : addr := shift a 0%Z in let a_5 : addr := shift a_1 0%Z in let a_6 : addr := shift a_5 2%Z in let a_7 : addr := t_4 (shift a_1 5%Z) in let a_8 : addr := shift a_7 0%Z in let a_9 : addr -> Z := havoc t_2 t_3 a_8 i_6 in let a_10 : addr := shift a_2 0%Z in ¬ i_6 = 0%Z -> x = base a -> ¬ x_1 = 0%Z -> 0%Z ≤ i_4 -> 0%Z ≤ i_6 -> i_4 ≤ i_6 -> 0%Z ≤ i_7 -> i_6 ≤ i_7 -> i_6 < x_2 -> region (base a_1) ≤ 0%Z -> region x ≤ 0%Z -> - 1%Z ≤ i_3 -> framed t_4 -> linked t -> sconst t_3 -> is_uint32 i_4 -> is_uint32 i_6 -> is_uint32 i_7 -> is_sint32 i_3 -> is_sint32 i_5 -> addr_le a_3 a -> is_uint32 x_2 -> is_uint32 x_1 -> p_valid_io_file_pvt t t_4 t_1 a_1 -> addr_le a (shift a_3 i_7) -> valid_rw t a_4 i_6 -> valid_rw t (shift a_3 0%Z) i_7 -> ¬ invalid t a_6 1%Z -> valid_rw t a_8 i_6 -> separated a_4 i_6 a_8 i_6 -> p_valid_io_file_pvt t t_4 (fun_updt (fun_updt (fun_updt t_1 (shift a_1 8%Z) i) (shift a_5 1%Z) i_1) a_6 i_2) a_1 -> (i_3 = - 1%Z -> i_5 = 4%Z ∨ i_5 = 11%Z) -> (∀(i_8 : Z), 0%Z ≤ i_8 -> i_8 < i_6 -> a_9 (shift a_7 i_8) = a_9 (shift a i_8)) -> a_6 = shift a_2 8%Z ∨ a_6 = shift a_10 1%Z ∨ shift a_10 2%Z = a_6.
Admitted.
