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

# lpt1 = # avol, # lpt0 = # avol, isbuf0 ↔ pstate = readonly, adr = adr0, keyset(gch) = gc-heap(lpt1, log1), log = log1, lpt = lpt0, ns = ns0, remove-refsize0(gstore0) = gstore0, remove-refsize0(istore0) = istore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # 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(pstate = readonly, 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), istore0 ⊑ istore, pstate = unbuffered → bleb = nobuffer, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore ⊦ ⟪if isbuf0 then err := EROFS else if freelist = [] then err := ENOSPC else {n := freelist.head; awbuf_remap#(n, adr0, m, log1, lpt0, ns0, bleb, pstate = readonly; avol; err); if err = ESUCCESS then {freelist := freelist.tail; lpt1[n] := mklp(lpt1[n].ref-size, 0, lpt1[n].flags, lpt1[n].gcheapidx); lpt1[n].ref-size := 0}}; log := log1; if err = ESUCCESS then {awbuf_add_log_leb#(n, 0, adr0, m, avol, lpt0, ns0, pstate = readonly; log, bleb; err); if err ≠ ESUCCESS then freelist := n ' + freelist}; log0 := log1; if err = ESUCCESS then {lpt1[n].flags := LP_GROUP_NODES; log0 := log0 + n '}⟫ ⟨pstate0 := pstate; apersistence_allocate_gnd#(adr0, istore, istore0, gstore0, m, ns0, true; ginval, gstore, log1, pstate; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ log1 = log0 ∧ ginval < # lpt1 ∧ synced(avol) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ pstate0 = readonly) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ err = err0), dups(log1)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information