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

# lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip or avol[m0] := unmapped⟫ (awbuf-inv(avol, bleb) ∧ # lpt = # avol), buffered(m2) = bleb, err0 = ESUCCESS

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 11:
# lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip⟫ (awbuf-inv(avol, bleb) ∧ # lpt = # avol), buffered(m2) = bleb, err0 = ESUCCESS
Proof step 12:
# lpt = # avol, m = m1, m0 = m2, m2 < # avol, awbuf-inv(avol, bleb), synced(avol), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪avol[m0] := unmapped⟫ (awbuf-inv(avol, bleb) ∧ # lpt = # avol), buffered(m2) = bleb, err0 = ESUCCESS

Rule argument

Additional information