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

# avol0 = # lpt, # lpt0 = # lpt, # avol1 = # lpt, lpf1 = LP_GROUP_NODES ↔ n ∈ gstore, lpt0[n] = mklp(m0, m14, lpf2, m15), (∅)[n] = indexblock(indx, lax1, m10), (∅)[n] = groupblock(gndx1, lax2, m11), lpt[n] = mklp(m7, m8, lpf1, m9), gstore[n] = groupblock(gndx, lax, m6), lpt[bleb.leb] = mklp(m3, m4, lpf0, m5), dom istore ∩ elems nx = ∅, ginval < # lpt, n < # lpt, awbuf-inv(avol0, bleb), n ∈ nx, istore0 ⊑ istore, n ∈ gstore ∧ ¬ n ∈ ginval → avol0[n].mapped? ∧ abs-nodes(avol0[n].data, gndx, lax, m8 = LEB_SIZE) ∧ (m8 ≠ LEB_SIZE → m8 = # avol0[n].data), n ∈ gstore → m7 = m6, avol0[n].mapped? → avol1[n] = mapped(avol0[n].data.align↓), ¬ avol0[n].mapped? ∧ avol1[n].mapped? → # avol1[n].data ≤ LEB_SIZE ∧ is-aligned(# avol1[n].data, EB_PAGE_SIZE), avol0[n].mapped? → is-aligned(# avol0[n].data, EB_PAGE_SIZE), ∀ n. n < # lpt ∧ lpt0[n].flags = LP_FREE → lpt0[n].ref-size = 0, ∀ n. n < # lpt ∧ lpt0[n].flags = LP_GROUP_NODES ∧ lpt[n].flags = LP_GROUP_NODES ∧ ¬ n ∈ nx → lpt[n].size = lpt0[n].size, n ∈ gstore ∨ n ∈ ginval, bleb = nobuffer ∨ bleb.leb < # lpt ∧ (bleb.leb = nx.last ∧ lpf0 = LP_GROUP_NODES ∨ lpf0 = LP_INDEX_NODES) ⊦ lpf1 = LP_INDEX_NODES, lpf2 = LP_FREE, lpf2 = LP_INDEX_NODES, lpf2 = LP_GROUP_NODES, m0 = 0, nx = [], n ∈ gstore0, n ∈ istore0, n ∈ istore

User applied rule constructor cut

And closed the goal!

Rule argument

var: lpf2

Additional information

Used simplifier rules: lpropflags, lprops freely generated by LP_FREE, LP_GROUP_NODES, LP_INDEX_NODES, mklp ;;