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

# avol0 = # avol1, # lpt0 = # avol1, # buf1 = EB_PAGE_SIZE, avol0[m4] = mapped(buf2), align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, err = err0, m0 = # buf2, m1 = buffered(m4).leb, n0 = n + m2, n1 = 0, buffered(m4).isbuf?, m2 < EB_PAGE_SIZE, m4 < # avol1, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(n + m2, EB_PAGE_SIZE), is-aligned(# buf2, EB_PAGE_SIZE), # avol1[m4].data + n3 ≤ LEB_SIZE, n3 ≤ # buf3, EB_PAGE_SIZE ≤ m2 + n3, # buf2 + m2 + n3 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + n + m2 ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪buf := copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n); choose n2 with n2 < n0 ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then avol0[m1] := mapped(avol0[m1].data + mkempbuf(m0 - # avol0[m1].data) + subarray(buf, n1, n2)) ifnone skip; wbuf := mkwbuf(buf1, # buf2, m2); rofs := false; if err = ESUCCESS then {wbuf.content := copy(buf3, n, wbuf.content, 0, (m2 + n3) % EB_PAGE_SIZE); wbuf.offset := wbuf.offset + align↓(m2 + n3, EB_PAGE_SIZE); wbuf.nbytes := (m2 + n3) % EB_PAGE_SIZE} else rofs := true⟫ ⟨rofs0 := false; awbuf_write_buf#(n3, buf3, adr0, m3, plog0, lpt0, ns0, buffered(m4); avol1, rofs0; err1)⟩ (abs(avol1, buffered(m4), wbuf, avol0, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err1), err = ESUCCESS, n3 = 0

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 96:
# buf1 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, avol0[m4] = mapped(buf2), align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, buf = copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n), err = err0, m0 = # buf2, m1 = buffered(m4).leb, n0 = n + m2, n1 = 0, buffered(m4).isbuf?, m4 < # avol1, m2 < EB_PAGE_SIZE, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(# buf2, EB_PAGE_SIZE), is-aligned(n + m2, EB_PAGE_SIZE), # buf2 + n + m2 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + m2 + n3 ≤ LEB_SIZE, EB_PAGE_SIZE ≤ m2 + n3, n3 ≤ # buf3, # avol1[m4].data + n3 ≤ LEB_SIZE, 0 + n ≤ # buf3, m2 + n ≤ # copy(buf1, 0, mkbuf(n + m2), 0, m2), 0 + m2 ≤ # buf1, 0 + m2 ≤ # mkbuf(n + m2), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪choose n2 with n2 < n0 ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then avol0[m1] := mapped(avol0[m1].data + mkempbuf(m0 - # avol0[m1].data) + subarray(buf, n1, n2)) ifnone skip; wbuf := mkwbuf(buf1, # buf2, m2); rofs := false; if err = ESUCCESS then {wbuf.content := copy(buf3, n, wbuf.content, 0, (m2 + n3) % EB_PAGE_SIZE); wbuf.offset := wbuf.offset + align↓(m2 + n3, EB_PAGE_SIZE); wbuf.nbytes := (m2 + n3) % EB_PAGE_SIZE} else rofs := true⟫ ⟨rofs0 := false; awbuf_write_buf#(n3, buf3, adr0, m3, plog0, lpt0, ns0, buffered(m4); avol1, rofs0; err1)⟩ (abs(avol1, buffered(m4), wbuf, avol0, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err1), err = ESUCCESS, n3 = 0

Rule argument

Additional information

Used simplifier rules: ⊦ buffered(m).isbuf?; (s)% ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)% ⊦ n + 0 = n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ # copy(buf, m, buf0, m0, n) = # buf0; (s)% ⊦ # mkbuf(n) = n; (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)% ⊦ m ≤ m; (s)% ⊦ m ≤ m + n; (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%lf: ⊦ m < n ∧ n < n0 → m +1 < n0; (forward) from specification nat-basic%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic%transitivity: ⊦ n < n0 ∧ n0 < n1 → n < n1; (forward) from specification oelem[nat-set]% ⊦ m < n → n ≠ 0; (s)% ⊦ m +1 = m + 1; (s)% ⊦ m < n → ¬ n < m; (s)%n ≠ 0, m % n = 0 ⊦ align↓(m, n) = m; (s)% ⊦ m + n = m + n0 ↔ n = n0; (s)%m ≠ 0, is-aligned(n1, m) ⊦ is-aligned(n0 + n1, m) ↔ is-aligned(n0, m); (s)% ⊦ ¬ m + n < m; (s)