[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 6 from proof inv-deallocate-gnd (previous step)

syn ↔ true, istore = istore1, istore0 = istore2, remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, elems nx ∩ ginval = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, btree-inv(rp, adr, istore2, istore1, zh, ri, fi), inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), n ∈ gstore0, n ∈ gstore, istore1 ⊑ istore2, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore ⊦ ⟪if syn ∧ n ∈ gstore ∧ ¬ n ∈ nx then {fail_or_success#(; ; err); if err = ESUCCESS then gstore := gstore -- n, ginval := ginval ++ n} else abort⟫ ( inv(gstore \ ginval) ∧ elems nx ∩ ginval = ∅ ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore) ∧ (pstate.index? → pstate.lnum ∈ istore2)), dups(nx), n ∈ nx

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information