[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 36 from proof refine-read-buf (previous step)

# avol0 = # avol1, # lpt0 = # avol1, # buf2 = EB_PAGE_SIZE, LEB_SIZE = n0 + # buf4, avol1[m2] = mapped(buf1), avol0[m2] = mapped(buf4), (m0 ≤ m6 ⊃ 0;m0 - m6) < EB_PAGE_SIZE, m2 < # avol1, n2 + (m0 ≤ m6 ⊃ 0;m0 - m6) < EB_PAGE_SIZE, abs(avol1, buffered(m2), mkwbuf(buf2, m6, n2 + (m0 ≤ m6 ⊃ 0;m0 - m6)), avol0, rofs), awbuf-inv(avol1, buffered(m2)), ebm-vol-inv(avol0), is-aligned(m6, EB_PAGE_SIZE), # buf4 ≤ LEB_SIZE, m0 + n1 + (m0 ≤ m6 ⊃ m6 - m0;0) ≤ LEB_SIZE, n1 + (m0 ≤ m6 ⊃ m6 - m0;0) ≤ # buf3, m6 ≤ m0 + n1 + (m0 ≤ m6 ⊃ m6 - m0;0), m0 ≤ m6 + n2 + (m0 ≤ m6 ⊃ 0;m0 - m6), (m0 ≤ m6 ⊃ m6 - m0;0) + min(n1, n2) ≤ # buf3, (m0 ≤ m6 ⊃ 0;m0 - m6) + min(n1, n2) ≤ EB_PAGE_SIZE, (m0 ≤ m6 ⊃ m6 - m0;0) ≤ # buf3, m6 ≤ LEB_SIZE, ¬ rofs → # buf4 = m6, rofs → m6 ≤ # buf4, ¬ m0 ≤ m6 → m6 ≤ m0 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; buf := copy(buf4 + mkempbuf(n0), m0, buf3, 0, n1 + (m0 ≤ m6 ⊃ m6 - m0;0)); if err = ESUCCESS then buf3 := copy(avol1[m2].data + mkempbuf(LEB_SIZE - # avol1[m2].data), m0, buf3, 0, n1 + (m0 ≤ m6 ⊃ m6 - m0;0)) else {n := n1 + (m0 ≤ m6 ⊃ m6 - m0;0); choose buf with # buf = # buf3 ∧ range=(buf, n, buf3, n, # buf3 - n) in buf3 := buf}⟩ (copy(buf2, (m0 ≤ m6 ⊃ 0;m0 - m6), buf, (m0 ≤ m6 ⊃ m6 - m0;0), min(n1, n2)) = buf3 ∧ ESUCCESS = err)

User applied rule exists right

And obtained the following new goals

Proof step 37:
# buf2 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, LEB_SIZE = n0 + # buf4, avol0[m2] = mapped(buf4), avol1[m2] = mapped(buf1), n2 + (m0 ≤ m6 ⊃ 0;m0 - m6) < EB_PAGE_SIZE, m2 < # avol1, (m0 ≤ m6 ⊃ 0;m0 - m6) < EB_PAGE_SIZE, abs(avol1, buffered(m2), mkwbuf(buf2, m6, n2 + (m0 ≤ m6 ⊃ 0;m0 - m6)), avol0, rofs), awbuf-inv(avol1, buffered(m2)), ebm-vol-inv(avol0), is-aligned(m6, EB_PAGE_SIZE), m6 ≤ LEB_SIZE, (m0 ≤ m6 ⊃ m6 - m0;0) ≤ # buf3, (m0 ≤ m6 ⊃ 0;m0 - m6) + min(n1, n2) ≤ EB_PAGE_SIZE, (m0 ≤ m6 ⊃ m6 - m0;0) + min(n1, n2) ≤ # buf3, m0 ≤ m6 + n2 + (m0 ≤ m6 ⊃ 0;m0 - m6), m6 ≤ m0 + n1 + (m0 ≤ m6 ⊃ m6 - m0;0), n1 + (m0 ≤ m6 ⊃ m6 - m0;0) ≤ # buf3, m0 + n1 + (m0 ≤ m6 ⊃ m6 - m0;0) ≤ LEB_SIZE, # buf4 ≤ LEB_SIZE, ¬ m0 ≤ m6 → m6 ≤ m0, rofs → m6 ≤ # buf4, ¬ rofs → # buf4 = m6 ⊦ (⌊ESUCCESS⌋ ∨ ESUCCESS = ESUCCESS) ∧ ⟨err := ESUCCESS; buf := copy(buf4 + mkempbuf(n0), m0, buf3, 0, n1 + (m0 ≤ m6 ⊃ m6 - m0;0)); if err = ESUCCESS then buf3 := copy(avol1[m2].data + mkempbuf(LEB_SIZE - # avol1[m2].data), m0, buf3, 0, n1 + (m0 ≤ m6 ⊃ m6 - m0;0)) else {n := n1 + (m0 ≤ m6 ⊃ m6 - m0;0); choose buf with # buf = # buf3 ∧ range=(buf, n, buf3, n, # buf3 - n) in buf3 := buf}⟩ (copy(buf2, (m0 ≤ m6 ⊃ 0;m0 - m6), buf, (m0 ≤ m6 ⊃ m6 - m0;0), min(n1, n2)) = buf3 ∧ ESUCCESS = err)

Rule argument

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

Additional information

Used terms: ESUCCESS