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

# lpt1 = # avol, # lpt0 = # avol, lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), gstore[n] = groupblock(gndx, lax, m0), keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, n < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(true, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt1, freelist), inv(gstore \ ginval), inv(gstore0), inv(istore), inv(istore0), log-group-block(log1, lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, log1), synced(avol), n ∈ gstore, n ∈ gstore0, istore0 ⊑ istore, ¬ dups(log1), ¬ n ∈ log1 ⊦ ⟨apersistence_deallocate_gnd#(n, adr0, istore, istore0, gstore0, log1, m, ns0, readonly, true; ginval, gstore; err0)⟩ (abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # avol ∧ EROFS = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 18:
# lpt0 = # avol, # lpt1 = # avol, isbuf ↔ true, gstore[n] = groupblock(gndx, lax, m0), lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), adr = adr0, istore = istore1, istore0 = istore2, keyset(gch) = gc-heap(lpt1, log1), log = log1, maxino = m, ns = ns0, pstate = readonly, remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, n < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore, ginval), abs-istore(avol, lpt1, istore2), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(true, bleb, lpt1, avol), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(istore1), inv(istore2), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt1), lpt-free-unref(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), synced(avol), n ∈ gstore0, n ∈ gstore, istore1 ⊑ istore2 ⊦ ⟨if isbuf ∧ n ∈ gstore ∧ ¬ n ∈ log then {fail_or_success#(; ; err); if err = ESUCCESS then gstore := gstore -- n, ginval := ginval ++ n} else abort⟩ (abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # avol ∧ EROFS = err), dups(log1), n ∈ log1

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_deallocate_gnd# (N, ROOTADR, ISTORE, ISTORE0, GSTORE0, NL, MAXINO, OS, PSTATE, PSYNCED ; GINVAL, GSTORE ; ERR ) {if PSYNCED ∧ N ∈ GSTORE ∧ ¬ N ∈ NL then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then GSTORE := GSTORE -- N, GINVAL := GINVAL ++ N} else abort };