[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 25 from proof refine-get-gc-block (previous step)

# lpt = # avol, lpt[n1] = mklp(m, m0, LP_GROUP_NODES, m1), keyset(gch) = gc-heap(lpt, log0), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, elems log0 ∩ ginval = ∅, dom gstore1 ∪ elems log0 = dom gstore2 ∪ ginval, ginval < # avol, n1 < # avol, abs-istore(avol, lpt, istore2), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(pstate = readonly, bleb, lpt, avol), bufs-log-only(bleb, log0, lpt), flash-lpt-cons(lpt0, istore1, gstore1), freelist-cons(lpt, freelist), inv(gstore2 \ ginval), inv(gstore1), inv(istore2), inv(istore1), log-group-block(log0, lpt), lpt-free-unref(lpt), istore1 ⊑ istore2, ¬ dups(log0), ¬ n1 ∈ gstore2, ¬ n1 ∈ log0, isbuf → synced(avol), pstate = unbuffered → bleb = nobuffer, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate.journal? → log0 ≠ [] ∧ pstate.lnum = log0.last ∧ pstate.lnum ∈ gstore2, pstate.index? → pstate.lnum ∈ istore2, pstate = unbuffered → isbuf, ∀ n. (n < # avol ∧ lpt[n].flags = LP_GROUP_NODES ↔ n ∈ gstore2) ∧ (n ∈ gstore2 ∧ ¬ n ∈ ginval → abs-leb(avol[n], gstore2[n], lpt[n])) ∧ (n ∈ gstore2 → lpt[n].ref-size = gstore2[n].ref-size) ⊦ (¬ n ∈ gstore2 ∨ n ∈ log0) ∧ ⟨err := ENOSPC⟩ ( (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ n1 = n0 ∧ ESUCCESS = err)

Proof step 25 from proof refine-get-gc-block (previous step)

User applied rule all left

And closed the goal!

Rule argument

Additional information