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

# buf2 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, avol1[m] = mapped(buf1), buf = buf0, m < # avol1, abs(avol1, bleb, mkwbuf(buf2, m6, m4), avol0, rofs), awbuf-inv(avol1, bleb), ebm-vol-inv(avol0), m0 + n ≤ LEB_SIZE, n ≤ # buf0, bleb ≠ nobuffer → bleb.leb < # avol1 ∧ avol0[bleb.leb].mapped? ∧ m4 < EB_PAGE_SIZE ∧ (¬ rofs → # avol0[bleb.leb].data = m6) ∧ (rofs → m6 ≤ # avol0[bleb.leb].data) ∧ is-aligned(m6, EB_PAGE_SIZE) ⊦ ⟪apersistence_io_read#(m, m0, 0, n, adr0, m5, plog0, avol0, lpt0, ns0; buf; err); if err = ESUCCESS ∧ buffered(m) = bleb ∧ m0 ≤ m6 + m4 ∧ m6 ≤ m0 + n then let m1 = (m0 ≤ m6 ⊃ 0;m0 - m6), m = (m0 ≤ m6 ⊃ m6 - m0;0) in buf := copy(buf2, m1, buf, m, min(n - m, m4 - m1))⟫ ⟨awbuf_read_buf#(m, m0, n, adr0, m5, plog0, avol1, lpt0, ns0, bleb, rofs; buf0; err0)⟩ (buf = buf0 ∧ err = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 12:
# avol0 = # avol1, # lpt0 = # avol1, # buf2 = EB_PAGE_SIZE, avol1[m2] = mapped(buf1), adr = adr0, avol = avol0, buf = buf3, buf0 = buf, lpt = lpt0, m = m5, m1 = m2, n0 = 0, ns = ns0, plog = plog0, m2 < # avol1, abs(avol1, bleb, mkwbuf(buf2, m6, m4), avol0, rofs), awbuf-inv(avol1, bleb), ebm-vol-inv(avol0), n ≤ # buf3, m0 + n ≤ LEB_SIZE, bleb ≠ nobuffer → bleb.leb < # avol1 ∧ avol0[bleb.leb].mapped? ∧ m4 < EB_PAGE_SIZE ∧ (¬ rofs → # avol0[bleb.leb].data = m6) ∧ (rofs → m6 ≤ # avol0[bleb.leb].data) ∧ is-aligned(m6, EB_PAGE_SIZE) ⊦ ⟪if m1 < # avol ∧ avol[m1].mapped? ∧ n0 + n ≤ # buf0 ∧ m0 + n ≤ LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m1].data + mkempbuf(LEB_SIZE - # avol[m1].data), m0, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf0, 0, buf, 0, n0) ∧ range=(buf0, n0 + n, buf, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort; buf := buf0; if err = ESUCCESS ∧ buffered(m2) = bleb ∧ m0 ≤ m6 + m4 ∧ m6 ≤ m0 + n then let m1 = (m0 ≤ m6 ⊃ 0;m0 - m6), m = (m0 ≤ m6 ⊃ m6 - m0;0) in buf := copy(buf2, m1, buf, m, min(n - m, m4 - m1))⟫ ⟨awbuf_read_buf#(m2, m0, n, adr0, m5, plog0, avol1, lpt0, ns0, bleb, rofs; buf3; err0)⟩ (buf = buf3 ∧ err = err0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_io_read# (LNUM, OFFSET, N0, N, PROOTADR, PMAXINO, PLOG, PVOL, PLPT, PORPHANS ; BUF ; ERR ) {if LNUM < # PVOL ∧ PVOL[LNUM].mapped? ∧ N0 + N ≤ # BUF ∧ OFFSET + N ≤ LEB_SIZE then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then BUF := copy ( PVOL[LNUM].data + mkempbuf(LEB_SIZE - # PVOL[LNUM].data), OFFSET, BUF, N0, N) else choose BUF0 with # BUF0 = # BUF ∧ range=(BUF, 0, BUF0, 0, N0) ∧ range=(BUF, N0 + N, BUF0, N0 + N, # BUF - N0 + N) in BUF := BUF0} else abort };