[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 23 from proof refine-add-ind (previous step)

# lpt = # avol, # lpt0 = # avol, pstate = readonly ↔ isbuf0, lpt[bleb.leb] = mklp(m4, m3, lpf, m2), adr = adr1, adr1 = adr2, bleb0 = bleb, keyset(gch) = gc-heap(lpt, log1), log = log1, m0 = m, m1 = LEB_SIZE, ns = ns0, remove-refsize0(istore0) = istore0, remove-refsize0(gstore0) = gstore0, elems log1 ∩ ginval = ∅, dom gstore0 ∪ elems log1 = dom gstore ∪ ginval, ginval < # avol, abs-gstore(avol, lpt, gstore, ginval), abs-istore(avol, lpt, istore), awbuf-inv(avol, bleb), bin-heap-inv(gch, lpt), buf-ro-rw-mode(pstate = readonly, bleb, lpt, avol), bufs-log-only(bleb, log1, lpt), flash-lpt-cons(lpt0, istore0, gstore0), freelist-cons(lpt, freelist), inv(istore0), inv(istore), inv(gstore0), inv(gstore \ ginval), log-group-block(log1, lpt), lpt-free-unref(lpt), lpt-free-unref(lpt0), lpt-leb-size(lpt), lpt-leb-size(lpt0), lpt-ram-flash(lpt, lpt0, log1), istore0 ⊑ istore, pstate ≠ readonly → bleb.isbuf? ∧ bleb.leb < # avol ∧ lpf = LP_INDEX_NODES ∧ avol[bleb.leb].mapped? ∧ (m3 + 2 * NODE_HEADER_SIZE + ind.alignedsize ≤ LEB_SIZE → m3 = # avol[bleb.leb].data), pstate = unbuffered → isbuf, pstate.index? → pstate.lnum ∈ istore, pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum), pstate = unbuffered → bleb = nobuffer, isbuf → synced(avol), pstate.index? ∨ pstate = readonly ⊦ [if ¬ isbuf0 → bleb0.isbuf? ∧ bleb0.leb < # lpt ∧ lpt[bleb0.leb].flags = LP_INDEX_NODES ∧ avol[bleb0.leb].mapped? ∧ (lpt[bleb0.leb].size + ind.flashsize ≤ LEB_SIZE → lpt[bleb0.leb].size = # avol[bleb0.leb].data) then let isbuf = ? in {awbuf_is_readonly#(adr0, m0, log, avol, lpt0, ns, bleb0, isbuf0; ; isbuf); if isbuf then err := EROFS else let buf = mkbuf(ind.flashsize), m = ?, bleb = ? in {awbuf_get_buf#(adr0, m0, log, avol, lpt0, ns, bleb0, isbuf0; ; bleb); encode_index_node#(ind, 0; m, buf; err); if err = ESUCCESS then if ¬ lpt[bleb.leb].size + m ≤ m1 then {debug#("persistence: trying to write beyond LEB size"); awbuf_enter_readonly#(adr0, m0, log, avol, lpt0, ns, bleb0; ; isbuf0); err := ENOSPC} else {awbuf_write_buf#(m, buf, adr0, m0, log, lpt0, ns, bleb0; avol, isbuf0; err); if err = ESUCCESS then {adr := @(bleb.leb, lpt[bleb.leb].size, m); lpt[bleb.leb].size := lpt[bleb.leb].size + m} else lpt[bleb.leb].size := m1} else {debug#("persistence: could not encode index node"); awbuf_enter_readonly#(adr0, m0, log, avol, lpt0, ns, bleb0; ; isbuf0)}}} else abort] ( lpt-free-unref(lpt) ∧ freelist-cons(lpt, freelist) ∧ bin-heap-inv(gch, lpt) ∧ keyset(gch) = gc-heap(lpt, log1) ∧ bufs-log-only(bleb, log1, lpt) ∧ # lpt = # avol ∧ log-group-block(log1, lpt) ∧ buf-ro-rw-mode(isbuf0, bleb, lpt, avol) ∧ lpt-leb-size(lpt) ∧ lpt-ram-flash(lpt, lpt0, log1) ∧ awbuf-inv(avol, bleb) ∧ # lpt0 = # avol → ⟨apersistence_add_ind#(ind, adr0, istore0, ginval, gstore, gstore0, log1, m, ns0; adr2, istore, pstate, isbuf; err0)⟩ ( abs-istore(avol, lpt, istore) ∧ abs-gstore(avol, lpt, gstore, ginval) ∧ ginval < # lpt ∧ (isbuf → synced(avol)) ∧ (pstate = unbuffered → bleb = nobuffer) ∧ (pstate = readonly ↔ isbuf0) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb = buffered(pstate.lnum)) ∧ adr = adr2 ∧ err = err0)), dups(log1)

Heuristic conditional right split applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ mklp(n2, n3, lpf, m).flags = lpf; (s)% ⊦ mklp(n2, n3, lpf, m).size = n3; (s)% ⊦ ind.flashsize = 2 * NODE_HEADER_SIZE + ind.alignedsize; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic