| # lpt1 = # avol, # lpt0 = # avol, (elems nx ∪ dom gstore0) ++ n = dom gstore1 ∪ ginval, lpt1[n] = mklp(m0, m1, LP_GROUP_NODES, m2), avol[n] = mapped(buf), gstore1[n] = groupblock(gndx1, lax0, m0), keyset(gch) = gc-heap(lpt1, nx + n '), remove-refsize0(istore1) = istore1, remove-refsize0(gstore0) = gstore0, ginval ∩ elems nx = ∅, n < # avol, ginval < # avol, abs-gstore(avol, lpt1, gstore1, ginval), abs-istore(avol, lpt1, istore2), awbuf-inv(avol, buffered(n)), bin-heap-inv(gch, lpt1), buf-ro-rw-mode(false, buffered(n), lpt1, avol), bufs-log-only(buffered(n), nx + n ', lpt1), flash-lpt-cons(lpt0, istore1, gstore0), freelist-cons(lpt1, freelist), inv(groupblock(gndx1, lax0, m0)), inv(istore1), inv(istore2), inv(gstore0), inv(gstore1 \ ginval), log-group-block(nx + n ', lpt1), lpt-free-unref(lpt1), lpt-free-unref(lpt0), lpt-leb-size(lpt1), lpt-leb-size(lpt0), lpt-ram-flash(lpt1, lpt0, nx + n '), n ∈ gstore1, istore1 ⊑ istore2, ⌊err1⌋ , isbuf1 → synced(avol), m1 + gndx0.flashsize ≤ LEB_SIZE → m1 = # buf ⊦ ⟨isbuf1 := ?⟩ ( abs-gstore(avol, lpt1, gstore1[n, (gstore1[n].gndlist:= gstore1[n].gndlist).ladrlist:= gstore1[n].ladrlist], ginval) ∧ (isbuf1 → synced(avol)) ∧ ax1 = ax1), gndx0 = [], dups(nx), n ∈ nx, n ∈ ginval |
Used simplifier rules: ⊦ groupblock(gndx, lax, m).gndlist = gndx; (s)%⊦ groupblock(gndx, lax, m).gndlist:= gndx0 = groupblock(gndx0, lax, m); (s)% ⊦ groupblock(gndx, lax, m).ladrlist = lax; (s)%⊦ groupblock(gndx, lax, m).ladrlist:= lax0 = groupblock(gndx, lax0, m); (s)% ⊦ gstore[n] = gblock ∧ n ∈ gstore → gstore[n, gblock] = gstore; (s)