[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 92 from proof inv-recover (previous step)

# lpt3 = # avol0, # avol = # avol0, # lpt2 = # avol0, # avol2 = # avol0, lpt3[n] = mklp(m2, m3, LP_GROUP_NODES, m4), replay-lpt(replay-log(lpt3, log2), log2, # avol0)[n] = mklp(m, m0, LP_GROUP_NODES, m1), gc-heap(replay-lpt(replay-log(lpt3, log2), log2, # avol0), log2) = keyset(gch), keyset(gch1) = gc-heap(lpt2, log2), n < # avol0, avol-replay-lpt-unchanged(avol, avol2, replay-log(lpt3, log2), log2), awbuf-inv(avol2, nobuffer), awbuf-inv(avol0, bleb1), bin-heap-inv(gch1, lpt2), bin-heap-inv(gch, lpt), buf-ro-rw-mode(isbuf1, bleb1, lpt2, avol0), bufs-log-only(bleb1, log2, lpt2), freelist-cons(lpt2, log5), freelist-cons(replay-lpt(replay-log(lpt3, log2), log2, # avol0), freelist), id-idx(replay-lpt(replay-log(lpt3, log2), log2, # avol0), lpt), log-group-block(log2, lpt2), log-group-block(log2, replay-lpt(replay-log(lpt3, log2), log2, # avol0)), lpt-free-unref(lpt2), lpt-free-unref(lpt3), lpt-leb-size(lpt2), lpt-leb-size(lpt3), lpt-ram-flash(lpt2, lpt3, log2), synced(avol0), synced(avol), valid-indices(lpt3, log2), avol ↓ avol0 ⊦ m0 = m3, dups(log2), n ∈ log2

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 93:
m < n, n ≤ # lpt ⊦ replay-lpt(lpt, nx, n)[m] = (lpt[m].flags = LP_FREE ∨ m ∈ nx ⊃ lpt[m] ;(lpt[m].flags = LP_INDEX_NODES ∧ lpt[m].ref-size ≠ 0 ⊃ lpt[m].size:= LEB_SIZE ;(lpt[m].ref-size = 0 ⊃ mklp(0, 0, LP_FREE, lpt[m].gcheapidx);lpt[m]) ) )
Proof step 94:
# avol2 = # avol0, # lpt2 = # avol0, # avol = # avol0, # lpt3 = # avol0, (replay-log(lpt3, log2)[n].flags = LP_FREE ∨ n ∈ log2 ⊃ replay-log(lpt3, log2)[n] ;(replay-log(lpt3, log2)[n].flags = LP_INDEX_NODES ∧ replay-log(lpt3, log2)[n].ref-size ≠ 0 ⊃ replay-log(lpt3, log2)[n].size:= LEB_SIZE ;(replay-log(lpt3, log2)[n].ref-size = 0 ⊃ mklp(0, 0, LP_FREE, replay-log(lpt3, log2)[n].gcheapidx);replay-log(lpt3, log2)[n]) ) ) = mklp(m, m0, LP_GROUP_NODES, m1), lpt3[n] = mklp(m2, m3, LP_GROUP_NODES, m4), gc-heap(replay-lpt(replay-log(lpt3, log2), log2, # avol0), log2) = keyset(gch), keyset(gch1) = gc-heap(lpt2, log2), n < # avol0, avol-replay-lpt-unchanged(avol, avol2, replay-log(lpt3, log2), log2), awbuf-inv(avol0, bleb1), awbuf-inv(avol2, nobuffer), bin-heap-inv(gch, lpt), bin-heap-inv(gch1, lpt2), buf-ro-rw-mode(isbuf1, bleb1, lpt2, avol0), bufs-log-only(bleb1, log2, lpt2), freelist-cons(replay-lpt(replay-log(lpt3, log2), log2, # avol0), freelist), freelist-cons(lpt2, log5), id-idx(replay-lpt(replay-log(lpt3, log2), log2, # avol0), lpt), log-group-block(log2, replay-lpt(replay-log(lpt3, log2), log2, # avol0)), log-group-block(log2, lpt2), lpt-free-unref(lpt3), lpt-free-unref(lpt2), lpt-leb-size(lpt3), lpt-leb-size(lpt2), lpt-ram-flash(lpt2, lpt3, log2), synced(avol), synced(avol0), valid-indices(lpt3, log2), avol ↓ avol0, # avol0 ≤ # replay-log(lpt3, log2) ⊦ m0 = m3, dups(log2), n ∈ log2

Rule argument

spec: persistence-base name: replay-lpt-at seq: m < n, n ≤ # lpt ⊦ replay-lpt(lpt, nx, n)[m] = (lpt[m].flags = LP_FREE ∨ m ∈ nx ⊃ lpt[m] ;(lpt[m].flags = LP_INDEX_NODES ∧ lpt[m].ref-size ≠ 0 ⊃ lpt[m].size:= LEB_SIZE ;(lpt[m].ref-size = 0 ⊃ mklp(0, 0, LP_FREE, lpt[m].gcheapidx) ;lpt[m] ) ) ) subst: [m, n, nx, lpt] → [n, # avol0, log2, replay-log(lpt3, log2)] flags: <all paths>

Additional information

Used simplifier rules: ⊦ # replay-log(lpt, nx) = # lpt; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic%transitivity: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification oelem[nat-set]% ⊦ m < n → ¬ n < m; (s) Used terms: n, # avol0, log2, replay-log(lpt3, log2)