[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 14 from proof abs-gstore-crash (previous step)

# avol0 = # lpt, # lpt0 = # lpt, (n ∈ nx ∨ ¬ n ∈ ginval ⊃ groupblock(gndx0, lax0, (n ∈ gstore0 ⊃ gstore0[n].ref-size;0));gstore0[n]) = groupblock(gndx, lax, m), n < # lpt ∧ lpf1 = LP_GROUP_NODES ↔ n ∈ gstore, lpt[n] = mklp(m7, m8, lpf1, m9), gstore[n] = groupblock(gndx0, lax0, m6), replay-lpt(lpt0.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx)), nx, # lpt)[n] = mklp(m0, m1, lpf, m2), lpt[bleb.leb] = mklp(m3, m4, lpf0, m5), dom istore ∩ elems nx = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, ginval < # lpt, awbuf-inv(avol0, bleb), flash-lpt-cons(lpt0, istore0, gstore0), synced(avol0), avol1 ↓ avol0, istore0 ⊑ istore, n ∈ gstore ∧ ¬ n ∈ ginval → abs-leb(avol0[n], groupblock(gndx0, lax0, m6), mklp(m7, m8, lpf1, m9)), n ∈ gstore → m7 = m6, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt[n].size = lpt0[n].size, ∀ n. (n < # lpt ∧ lpt[n].flags = LP_INDEX_NODES ↔ n ∈ istore) ∧ (n ∈ istore → abs-leb(avol0[n], istore[n], lpt[n]) ∧ lpt[n].ref-size = istore[n].ref-size), bleb = nobuffer ∨ bleb.leb < # lpt ∧ (nx ≠ [] ∧ bleb.leb = nx.last ∧ lpf0 = LP_GROUP_NODES ∨ lpf0 = LP_INDEX_NODES) ⊦ (n < # lpt ∧ lpf = LP_GROUP_NODES ↔ n ∈ gstore ∨ n ∈ ginval) ∧ (n ∈ gstore ∧ ¬ n ∈ ginval → abs-leb(avol1[n], crash(gstore, gstore0, ginval, nx)[n], mklp(m0, m1, lpf, m2))) ∧ (n ∈ gstore ∨ n ∈ ginval → m0 = m)

User applied rule all left

And obtained the following new goals

Proof step 15:
# lpt0 = # lpt, # avol0 = # lpt, (n ∈ nx ∨ ¬ n ∈ ginval ⊃ groupblock(gndx0, lax0, (n ∈ gstore0 ⊃ gstore0[n].ref-size;0));gstore0[n]) = groupblock(gndx, lax, m), n < # lpt ∧ lpf1 = LP_GROUP_NODES ↔ n ∈ gstore, n < # lpt ∧ lpt[n].flags = LP_INDEX_NODES ↔ n ∈ istore, lpt[bleb.leb] = mklp(m3, m4, lpf0, m5), replay-lpt(lpt0.mapIndices(elems nx, λ lp. mklp(lp.ref-size, LEB_SIZE, LP_GROUP_NODES, lp.gcheapidx)), nx, # lpt)[n] = mklp(m0, m1, lpf, m2), gstore[n] = groupblock(gndx0, lax0, m6), lpt[n] = mklp(m7, m8, lpf1, m9), dom istore ∩ elems nx = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ ginval, ginval < # lpt, awbuf-inv(avol0, bleb), flash-lpt-cons(lpt0, istore0, gstore0), synced(avol0), avol1 ↓ avol0, istore0 ⊑ istore, n ∈ gstore → m7 = m6, n ∈ gstore ∧ ¬ n ∈ ginval → abs-leb(avol0[n], groupblock(gndx0, lax0, m6), mklp(m7, m8, lpf1, m9)), n ∈ istore → abs-leb(avol0[n], istore[n], lpt[n]) ∧ lpt[n].ref-size = istore[n].ref-size, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt[n].size = lpt0[n].size, bleb = nobuffer ∨ bleb.leb < # lpt ∧ (nx ≠ [] ∧ bleb.leb = nx.last ∧ lpf0 = LP_GROUP_NODES ∨ lpf0 = LP_INDEX_NODES) ⊦ (n < # lpt ∧ lpf = LP_GROUP_NODES ↔ n ∈ gstore ∨ n ∈ ginval) ∧ (n ∈ gstore ∧ ¬ n ∈ ginval → abs-leb(avol1[n], crash(gstore, gstore0, ginval, nx)[n], mklp(m0, m1, lpf, m2))) ∧ (n ∈ gstore ∨ n ∈ ginval → m0 = m)

Rule argument

pos: left 20 terms: n abort: F discard: T computed: T

Additional information

Used terms: n