Proof step 60 from proof refine-sync (previous step)

Heuristic unfold applied rule call right

And obtained the following new goals

• Proof step 61:

  # lpt0 = # avol, # lpt1 = # avol, isbuf ↔ pstate = readonly, lpt1[bleb1.leb] = mklp(m0, m5, lpf, m4), adr = adr0, bleb0 = bleb1, 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, bleb1), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(pstate = readonly, bleb1, lpt1, avol), bufs-log-only(bleb1, 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(lpt0), lpt-free-unref(lpt1), lpt-leb-size(lpt0), lpt-leb-size(lpt1), lpt-ram-flash(lpt1, lpt0, log1), istore0 ⊑ istore, isbuf1 → synced(avol), pstate = unbuffered → bleb1 = nobuffer, pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum), pstate.journal? → log1 ≠ [] ∧ pstate.lnum = log1.last ∧ pstate.lnum ∈ gstore, pstate.index? → pstate.lnum ∈ istore, pstate = unbuffered → isbuf1, bleb1.isbuf? ∧ pstate ≠ readonly → bleb1.leb < # avol ∧ # avol[bleb1.leb].data ≤ LEB_SIZE ∧ avol[bleb1.leb].mapped? ∧ m5 = # avol[bleb1.leb].data ∧ lpf ≠ LP_FREE ∧ is-aligned(# avol[bleb1.leb].data, 2 * NODE_HEADER_SIZE) ⊦ [bleb := bleb0; awbuf_is_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1, pstate = readonly; ; isbuf); awbuf_get_page_size#(adr0, m, log1, avol, lpt0, ns0, bleb1, pstate = readonly; ; m1); err := ESUCCESS; isbuf0 := pstate = readonly; if ¬ isbuf then if bleb.isbuf? then let m0 = lpt1[bleb.leb].size in if ¬ is-aligned(m0, m1) then let m3 = m1 - m0 % m1 in let buf = mkbuf(m3) in {persistence_encode_padding_node#(; buf; err); if err = ESUCCESS then {awbuf_write_buf#(# buf, buf, adr0, m, log1, lpt0, ns0, bleb1; avol, isbuf0; err); if err = ESUCCESS then lpt1[bleb.leb] := mklp(lpt1[bleb.leb].ref-size, lpt1[bleb.leb].size + m3, lpt1[bleb.leb].flags, lpt1[bleb.leb].gcheapidx) else {debug#("persistence: flushing of LEB " + bleb.leb.toString + " failed"); lpt1[bleb.leb] := mklp(lpt1[bleb.leb].ref-size, LEB_SIZE, lpt1[bleb.leb].flags, lpt1[bleb.leb].gcheapidx); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf0)}} else {debug#("persistence: could not encode padding node"); awbuf_enter_readonly#(adr0, m, log1, avol, lpt0, ns0, bleb1; ; isbuf0)}} else err := EROFS] ( lpt-free-unref(lpt1) ∧ freelist-cons(lpt1, freelist) ∧ bin-heap-inv(gch, lpt1) ∧ keyset(gch) = gc-heap(lpt1, log1) ∧ bufs-log-only(bleb1, log1, lpt1) ∧ # lpt1 = # avol ∧ log-group-block(log1, lpt1) ∧ buf-ro-rw-mode(isbuf0, bleb1, lpt1, avol) ∧ lpt-leb-size(lpt1) ∧ lpt-ram-flash(lpt1, lpt0, log1) ∧ awbuf-inv(avol, bleb1) ∧ # lpt0 = # avol → ⟨apersistence_sync#(adr0, istore, istore0, ginval, gstore, gstore0, log1, m, ns0; pstate, isbuf1; err0)⟩ ( abs-istore(avol, lpt1, istore) ∧ abs-gstore(avol, lpt1, gstore, ginval) ∧ ginval < # lpt1 ∧ (isbuf1 → synced(avol)) ∧ (pstate = unbuffered → bleb1 = nobuffer) ∧ (pstate = readonly ↔ isbuf0) ∧ (pstate ≠ unbuffered ∧ pstate ≠ readonly → bleb1 = buffered(pstate.lnum)) ∧ err = err0)), dups(log1)

Rule argument

Additional information

Used simplifier rules: awbuf_get_buf# (WROOTADR, WMAXINO, WLOG, WVOL, WLPT, WORPHANS, WBUFLEB, AROFS ; ; WBUFLEB0 ) {WBUFLEB0 := WBUFLEB};