| # lpt1 = # avol0, # lpt = # avol0, # avol = # avol0, # lpt2 = # avol0, # lpt0 = # avol0, err = ESUCCESS, keyset(gch1) = gc-heap(cleanup-lpt(lpt), []), keyset(gch0) = gc-heap(lpt2, []), keyset(gch) = gc-heap(lpt2, log1), remove-refsize0(gstore1) = gstore1, remove-refsize0(istore1) = istore1, dom remove-refsize0(gstore2) ∩ ginval = ∅, elems log1 ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, ginval < # avol0, abs-gstore(avol, lpt2, gstore2, ginval), abs-istore(avol, lpt2, istore2), avol-cleanup-lpt-unchanged(avol, avol0, lpt), awbuf-inv(avol0, nobuffer), awbuf-inv(avol, nobuffer), awbuf-inv(avol, bleb0), bin-heap-inv(gch1, lpt1), bin-heap-inv(gch0, lpt), bin-heap-inv(gch, lpt2), buf-ro-rw-mode(false, bleb0, lpt2, avol), bufs-log-only(bleb0, log1, lpt2), flash-lpt-cons(lpt0, istore1, gstore1), freelist-cons(cleanup-lpt(lpt), freelist0), freelist-cons(lpt2, freelist), id-idx(cleanup-lpt(lpt), lpt1), id-idx(lpt2, lpt), inv(gstore2 \ ginval), inv(gstore1), inv(istore2), inv(istore1), log-group-block(log1, lpt2), lpt-free-unref(lpt0), lpt-free-unref(lpt2), lpt-leb-size(cleanup-lpt(lpt)), lpt-leb-size(lpt0), lpt-leb-size(lpt2), lpt-ram-flash(lpt1, lpt2, []), lpt-ram-flash(lpt2, lpt0, log1), synced(avol0), synced(avol), istore1 ⊑ istore2, pstate = unbuffered → bleb0 = nobuffer, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore2, pstate.index? → pstate.lnum ∈ istore2, pstate ≠ unbuffered → bleb0 = buffered(pstate.lnum), ∀ n. n ∈ log1 → n < # avol0 ∧ lpt2[n].flags = LP_GROUP_NODES ⊦ ⟨adr := adr2; ns := ns2; log1 := []; maxino := m2; pstate := unbuffered; ns0 := ?⟩ ( abs-istore(avol0, cleanup-lpt(lpt), remove-refsize0(istore2)) ∧ abs-gstore(avol0, cleanup-lpt(lpt), remove-refsize0(gstore2), ∅) ∧ adr = adr2 ∧ maxino = m2 ∧ log1 = [] ∧ ∅ < # avol0 ∧ ns = ns2 ∧ flash-lpt-cons(lpt2, remove-refsize0(istore2), remove-refsize0(gstore2)) ∧ pstate = unbuffered ∧ ns3 = ns0 ∧ ESUCCESS = err), pstate = readonly, dups(log1) |
# lpt0 = # avol0, # lpt2 = # avol0, # avol = # avol0, # lpt = # avol0, # lpt1 = # avol0, err = ESUCCESS, keyset(gch) = gc-heap(lpt2, log1), keyset(gch0) = gc-heap(lpt2, []), keyset(gch1) = gc-heap(cleanup-lpt(lpt), []), remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems log1 ∩ ginval = ∅, dom remove-refsize0(gstore2) ∩ ginval = ∅, dom gstore1 ∪ elems log1 = dom gstore2 ∪ ginval, ginval < # avol0, abs-gstore(avol, lpt2, gstore2, ginval), abs-istore(avol, lpt2, istore2), avol-cleanup-lpt-unchanged(avol, avol0, lpt), awbuf-inv(avol, bleb0), awbuf-inv(avol, nobuffer), awbuf-inv(avol0, nobuffer), bin-heap-inv(gch, lpt2), bin-heap-inv(gch0, lpt), bin-heap-inv(gch1, lpt1), buf-ro-rw-mode(false, bleb0, lpt2, avol), bufs-log-only(bleb0, log1, lpt2), flash-lpt-cons(lpt0, istore1, gstore1), freelist-cons(lpt2, freelist), freelist-cons(cleanup-lpt(lpt), freelist0), id-idx(lpt2, lpt), id-idx(cleanup-lpt(lpt), lpt1), inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval), log-group-block(log1, lpt2), lpt-free-unref(lpt2), lpt-free-unref(lpt0), lpt-leb-size(lpt2), lpt-leb-size(lpt0), lpt-leb-size(cleanup-lpt(lpt)), lpt-ram-flash(lpt2, lpt0, log1), lpt-ram-flash(lpt1, lpt2, []), synced(avol), synced(avol0), istore1 ⊑ istore2, pstate ≠ unbuffered → bleb0 = buffered(pstate.lnum), pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore2, pstate = unbuffered → bleb0 = nobuffer, ∀ n. n ∈ log1 → n < # avol0 ∧ lpt2[n].flags = LP_GROUP_NODES ⊦ ⟨ns := ns2; log1 := []; maxino := m2; pstate := unbuffered; ns0 := ?⟩ ( abs-istore(avol0, cleanup-lpt(lpt), remove-refsize0(istore2)) ∧ abs-gstore(avol0, cleanup-lpt(lpt), remove-refsize0(gstore2), ∅) ∧ adr2 = adr2 ∧ maxino = m2 ∧ log1 = [] ∧ ∅ < # avol0 ∧ ns = ns2 ∧ flash-lpt-cons(lpt2, remove-refsize0(istore2), remove-refsize0(gstore2)) ∧ pstate = unbuffered ∧ ns3 = ns0 ∧ ESUCCESS = err), pstate = readonly, dups(log1)