[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 32 from proof refine-write (previous step)

# avol0 = # lpt + m6, avol0[m6 + m8] = mapped(buf0), avol0[0] = mapped(buf1), avol0[m3] = mapped(buf2), avol0[m2] = mapped(buf3), n ≠ 0, m8 < # lpt, disk-layout(mksb(adr, m7, m2, m3, m4, m5, m6), # lpt), ebm-vol-inv(subarray(avol0, m6, # lpt)), ebm-vol-inv(avol0), is-aligned(n3 + # buf0, EB_PAGE_SIZE), is-aligned(n, EB_PAGE_SIZE), is-encoded(mksb(adr, m7, m2, m3, m4, m5, m6), buf1), is-encoded(lpt, lebs(avol0, m5, lptlebs(# lpt, LEB_SIZE))), is-encoded(log, buf3), is-encoded-pad(orphans, m4, buf2), mapped-full?(avol0, m5, lptlebs(# lpt, LEB_SIZE)), n2 + n ≤ # buf, n3 + # buf0 + n ≤ LEB_SIZE, logoff ≠ LEB_SIZE → # buf3 = logoff ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; avol := subarray(avol0, m6, # lpt); if err = ESUCCESS then if n ≠ 0 then avol[m8] := mapped(avol[m8].data + mkempbuf(n3 + # avol0[m6 + m8].data - # avol[m8].data) + subarray(buf, n2, n)) else {n1 := n2; n0 := n; m1 := m8; m0 := n3 + # avol0[m6 + m8].data; choose n4 with n4 < n0 ∧ is-aligned(n4, EB_PAGE_SIZE) in if n4 ≠ 0 then avol[m1] := mapped(avol[m1].data + mkempbuf(m0 - # avol[m1].data) + subarray(buf, n1, n4)) ifnone skip}⟩ ( avol = subarray(avol0, m6, # lpt)[m8, mapped(avol0[m6 + m8].data + mkempbuf(n3) + subarray(buf, n2, n))] ∧ is-encoded(log, avol0[m6 + m8, mapped(avol0[m6 + m8].data + mkempbuf(n3) + subarray(buf, n2, n))][m2].data) ∧ is-encoded-pad(orphans, m4, avol0[m3].data) ∧ ESUCCESS = err)

User applied rule exists right

And obtained the following new goals

Proof step 33:
# avol0 = # lpt + m6, avol0[m2] = mapped(buf3), avol0[m3] = mapped(buf2), avol0[0] = mapped(buf1), avol0[m6 + m8] = mapped(buf0), m8 < # lpt, disk-layout(mksb(adr, m7, m2, m3, m4, m5, m6), # lpt), ebm-vol-inv(avol0), ebm-vol-inv(subarray(avol0, m6, # lpt)), is-aligned(n, EB_PAGE_SIZE), is-aligned(n3 + # buf0, EB_PAGE_SIZE), is-encoded(log, buf3), is-encoded(lpt, lebs(avol0, m5, lptlebs(# lpt, LEB_SIZE))), is-encoded(mksb(adr, m7, m2, m3, m4, m5, m6), buf1), is-encoded-pad(orphans, m4, buf2), mapped-full?(avol0, m5, lptlebs(# lpt, LEB_SIZE)), n3 + # buf0 + n ≤ LEB_SIZE, n2 + n ≤ # buf, logoff ≠ LEB_SIZE → # buf3 = logoff ⊦ (⌊ESUCCESS⌋ ∨ ESUCCESS = ESUCCESS) ∧ ⟨err := ESUCCESS; avol := subarray(avol0, m6, # lpt); if err = ESUCCESS then if n ≠ 0 then avol[m8] := mapped(avol[m8].data + mkempbuf(n3 + # avol0[m6 + m8].data - # avol[m8].data) + subarray(buf, n2, n)) else {n1 := n2; n0 := n; m1 := m8; m0 := n3 + # avol0[m6 + m8].data; choose n4 with n4 < n0 ∧ is-aligned(n4, EB_PAGE_SIZE) in if n4 ≠ 0 then avol[m1] := mapped(avol[m1].data + mkempbuf(m0 - # avol[m1].data) + subarray(buf, n1, n4)) ifnone skip}⟩ ( avol = subarray(avol0, m6, # lpt)[m8, mapped(avol0[m6 + m8].data + mkempbuf(n3) + subarray(buf, n2, n))] ∧ is-encoded(log, avol0[m6 + m8, mapped(avol0[m6 + m8].data + mkempbuf(n3) + subarray(buf, n2, n))][m2].data) ∧ is-encoded-pad(orphans, m4, avol0[m3].data) ∧ ESUCCESS = err), n = 0

Rule argument

pos: right 1 terms: ESUCCESS abort: F discard: T computed: T

Additional information

Used terms: ESUCCESS