[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 41 from proof refine-allocate-gnd (previous step)

syn ↔ true, fi = fi1, fi0 = fi2, ginval = ginval3, ginval0 = ginval2, ginval1 = ginval3, gstore = gstore3, gstore0 = gstore2, gstore1 = gstore3, maxino = maxino0, nx = nx0, nx1 = nx0, remove-refsize0(gstore2) = gstore2, remove-refsize0(istore1) = istore1, elems nx0 ∩ ginval3 = ∅, dom gstore2 ∪ elems nx0 = dom gstore3 ∪ ginval3, 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, pstate.journal? → nx0 ≠ [] ∧ pstate.lnum = nx0.last ∧ pstate.lnum ∈ gstore3, pstate.index? → pstate.lnum ∈ istore2 ⊦ ⟨if syn then {fail_or_success#(; ; err); if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), nx := nx + n, ginval := ginval -- n} else abort⟩ (ginval = ginval1 -- n ∧ gstore = gstore1[n, groupblock([], [], 0)] ∧ nx = nx1 + n ' ∧ ESUCCESS = err), pstate = readonly, dups(nx0), n ∈ nx0, n ∈ gstore3

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information