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 goal7 (i_1 : Z) (t_2 : addr -> Z) (a_4 : addr) (i : Z) (a_2 : addr) (a : addr) (t_1 : addr -> Z) (a_5 : addr) (i_2 : Z) (t_3 : addr -> addr) (t : Z -> Z) (a_1 : addr) (a_3 : addr) : let x : Z := to_uint32 (i_1 - 1%Z) in let x_1 : Z := t_2 (shift a_4 x) in let x_2 : Z := i + i_1 in ¬ i_1 = 0%Z -> shift a_2 0%Z = shift a 0%Z -> t_1 (shift a_5 10%Z) = 1%Z -> ¬ x_1 = 10%Z -> 0%Z ≤ i -> 0%Z ≤ i_1 -> 0%Z ≤ x_2 -> i_2 ≤ x_2 -> region (base a_2) ≤ 0%Z -> region (base a_4) ≤ 0%Z -> x < i_2 -> framed t_3 -> linked t -> sconst t_2 -> is_uint32 i -> is_uint32 i_1 -> is_uint32 x_2 -> p_valid_io_file_pvt t t_3 t_1 a_1 -> p_valid_io_file_pvt t t_3 t_1 a_3 -> valid_rw t (shift a_4 0%Z) x_2 -> is_sint8 x_1 -> (∀(i_3 : Z), i_1 < i_3 -> i_3 ≤ x_2 -> ¬ t_2 (shift a_4 (i_3 - 1%Z)) = 10%Z) -> ¬ t_2 (shift a_4 (i_2 - 1%Z)) = 10%Z.
Admitted.
