[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 43 from proof refine-allocate-gnd (previous step)

remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval3 = ∅, dom gstore2 ∪ elems nx0 = dom gstore3 ∪ ginval3, pstate ≠ readonly, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(gstore3 \ ginval3), inv(gstore2), inv(istore2), inv(istore1), inv(gstore3[n, groupblock([], [], 0)] \ (ginval3 -- n)), ri-inj(fi2), ri-inj(fi1), istore1 ⊑ istore2, ¬ dups(nx0), ¬ n ∈ nx0, ¬ n ∈ gstore3, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore3, pstate.index? → pstate.lnum ∈ istore2 ⊦ ⟨fail_or_success#(; ; err); nx := nx0; gstore := gstore3; ginval := ginval3; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n⟩ (ginval = ginval3 -- n ∧ gstore = gstore3[n, groupblock([], [], 0)] ∧ nx = nx0 + n ' ∧ ESUCCESS = err)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 44:
remove-refsize0(istore1) = istore1, remove-refsize0(gstore2) = gstore2, elems nx0 ∩ ginval3 = ∅, dom gstore2 ∪ elems nx0 = dom gstore3 ∪ ginval3, btree-inv(rp, adr, istore2, istore1, zh, fi2, fi1), inv(gstore3[n, groupblock([], [], 0)] \ (ginval3 -- n)), inv(istore1), inv(istore2), inv(gstore2), inv(gstore3 \ ginval3), ri-inj(fi1), ri-inj(fi2), istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore3 ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; nx := nx0; gstore := gstore3; ginval := ginval3; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n⟩ (ginval = ginval3 -- n ∧ gstore = gstore3[n, groupblock([], [], 0)] ∧ nx = nx0 + n ' ∧ ESUCCESS = err), pstate = readonly, dups(nx0), n ∈ nx0, n ∈ gstore3

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};