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.
Require Import x509_parser.Globals.Globals.
Open Scope Z_scope.
Theorem goal10 : let a : addr := Mk_addr 2708%Z 0%Z in ∀(i_4 : Z) (i_3 : Z) (i_2 : Z) (i_1 : Z) (i : Z) (t : Z -> Z) (t_1 : Z -> addr) (t_3 : addr -> Z) (t_2 : addr -> Z) (t_5 : addr -> addr) (t_4 : addr -> addr) (a_2 : addr) (a_1 : addr), let x : Z := base a_2 in let x_1 : Z := base a_1 in let a_3 : addr := shift a_2 i_3 in let a_4 : addr := t_1 i_2 in let a_5 : addr := shift a_4 6%Z in let a_6 : addr := shift a_4 4%Z in let m : Z -> Z := fun_updt t 2708%Z 4%Z in let a_7 : addr := shift a_2 0%Z in ¬ i_1 = 0%Z -> ¬ i_4 = 0%Z -> ¬ Mk_addr 0%Z 0%Z = a_2 -> ¬ x = x_1 -> ¬ a_3 = Mk_addr 0%Z 0%Z -> ¬ havoc t_4 (fun_updt (fun_updt t_5 (shift a 0%Z) (Mk_addr 0%Z 0%Z)) (shift a 1%Z) (Mk_addr 0%Z 0%Z)) a 4%Z a_5 = Mk_addr 0%Z 0%Z -> havoc t_2 (fun_updt (fun_updt t_3 (shift a 2%Z) 0%Z) (shift a 3%Z) 0%Z) a 4%Z a_6 = 2%Z -> 0%Z ≤ i_1 -> i_3 ≤ i_1 -> i_4 ≤ i_1 -> 0%Z ≤ i_4 -> i ≤ i_4 -> i_3 + i_4 ≤ i_1 -> region x_1 ≤ 0%Z -> region x ≤ 0%Z -> 2%Z ≤ i -> 2%Z ≤ i_3 -> i ≤ 2147483648%Z + i_4 -> i_4 ≤ 2147483647%Z + i -> framed t_5 -> linked t -> is_uint8 i_2 -> is_uint16 i -> is_uint16 i_1 -> is_uint16 i_3 -> is_uint16 i_4 -> valid_rw t a_1 1%Z -> valid_rd m a_4 8%Z -> valid_rd m a_6 1%Z -> valid_rd m a_5 1%Z -> separated a_3 1%Z a 4%Z -> (0%Z < i_1 -> valid_rd t a_7 i_1) -> (0%Z < i_1 -> valid_rd m a_7 i_1) -> ¬ (0%Z < i_4 -> valid_rd m a_3 i_4).
Admitted.
