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.
Open Scope Z_scope.
Lemma goal0 (a : addr) (i_1 : Z) (t_1 : addr -> addr) (t_2 : addr -> addr) (i : Z) (a_1 : addr) (t : Z -> Z) (i_2 : Z) (i_3 : Z) : let a_2 : addr := shift a i_1 in let a_3 : addr := shift a 0%Z in let a_4 : addr -> addr := havoc t_1 t_2 a_3 29%Z in let a_5 : addr := shift a i in ¬ Mk_addr 0%Z 0%Z = a_1 -> region (base a) ≤ 0%Z -> region (base a_1) ≤ 0%Z -> i_1 ≤ 28%Z -> i_1 ≤ 29%Z -> framed t_2 -> linked t -> is_uint16 i -> is_uint16 i_1 -> is_uint16 i_2 -> is_sint32 i_3 -> valid_rd t a_2 1%Z -> valid_rw t a_3 29%Z -> (if decide (a_4 a_2 = Mk_addr 0%Z 0%Z) then i_2 = i_1 ∧ valid_rw t (shift a i_2) 1%Z ∧ (if decide (29%Z ≤ i_2) then i_3 = - 8062%Z else i_3 = 0%Z) else i_1 = i ∧ i_3 = - 8050%Z ∧ a_4 a_5 = a_1 ∧ valid_rd t a_5 1%Z) -> i_3 ≤ 0%Z.
Admitted.
