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

# lpt1 = # avol0, # lpt0 = # avol0, lpt1[n0] = mklp(0, m1, LP_FREE, m2), keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(gstore0) = gstore0, remove-refsize0(istore1) = istore1, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, pstate ≠ readonly, ginval < # avol0, n0 < # avol0, abs-gstore(avol0, lpt1, gstore, ginval), abs-istore(avol0, lpt1, istore2), awbuf-inv(avol0, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol0), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, n0 ' + nx0), inv(gstore \ ginval), inv(gstore0), inv(istore2), inv(istore1), 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(avol0), istore1 ⊑ istore2, ⌊err1⌋ , ¬ dups(log1), pstate = unbuffered → bleb = nobuffer, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore2, pstate ≠ unbuffered → bleb = buffered(pstate.lnum) ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; pstate0 := pstate; log := log1; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), log := log + n, ginval := ginval -- n, pstate := journal(n)⟩ ( abs-gstore(avol0, lpt1, gstore, ginval) ∧ log = log1 ∧ ginval < # avol0 ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err1 = err)

User applied rule exists right

And obtained the following new goals

Proof step 206:
# lpt0 = # avol0, # lpt1 = # avol0, lpt1[n0] = mklp(0, m1, LP_FREE, m2), keyset(gch) = gc-heap(lpt1, log1), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, n0 < # avol0, ginval < # avol0, abs-gstore(avol0, lpt1, gstore, ginval), abs-istore(avol0, lpt1, istore2), awbuf-inv(avol0, bleb), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, bleb, lpt1, avol0), bufs-log-only(bleb, log1, lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, n0 ' + nx0), 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(avol0), istore1 ⊑ istore2, ⌊err1⌋ , pstate ≠ unbuffered → bleb = buffered(pstate.lnum), pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate = unbuffered → bleb = nobuffer ⊦ (⌊err1⌋ ∨ err1 = ESUCCESS) ∧ ⟨err := err1; pstate0 := pstate; log := log1; if err = ESUCCESS then choose n with ¬ n ∈ gstore in gstore[n] := groupblock([], [], 0), log := log + n, ginval := ginval -- n, pstate := journal(n)⟩ ( abs-gstore(avol0, lpt1, gstore, ginval) ∧ log = log1 ∧ ginval < # avol0 ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err1 = err), pstate = readonly, dups(log1)

Rule argument

pos: right 1 terms: err1 abort: F discard: T computed: T

Additional information

Used terms: err1