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

# lpt = # avol, # buf1 = EB_PAGE_SIZE, avol[m4] = mapped(buf2), bleb = buffered(m4), buf0 = buf, m = m3, m0 = EB_PAGE_SIZE, n2 = n, wbuf = mkwbuf(buf1, m1, m2), m4 < # avol, ebm-vol-inv(avol), wbuf-cons(mkwbuf(buf1, m1, m2), mapped(buf2), rofs), ¬ rofs → m1 + m2 + n ≤ LEB_SIZE ∧ n ≤ # buf ⊦ ⟪if bleb ≠ nobuffer ∧ (¬ rofs → wbuf.offset + wbuf.nbytes + n2 ≤ LEB_SIZE ∧ n2 ≤ # buf0) then if rofs then err := EROFS else if wbuf.nbytes + n2 ≥ m0 then let n1 = align↓(wbuf.nbytes + n2, m0) in let n0 = n1 - wbuf.nbytes in let n = (wbuf.nbytes + n2) % m0 in let buf = mkbuf(n1) in {buf := copy(wbuf.content, 0, buf, 0, wbuf.nbytes); buf := copy(buf0, 0, buf, wbuf.nbytes, n0); apersistence_io_write#(bleb.leb, wbuf.offset, 0, n1, buf, adr, m, plog, lpt, ns; avol; err); if err = ESUCCESS then {wbuf.content := copy(buf0, n0, wbuf.content, 0, n); wbuf.offset := wbuf.offset + n1; wbuf.nbytes := n} else rofs := true} else {wbuf.content := copy(buf0, 0, wbuf.content, wbuf.nbytes, n2); wbuf.nbytes := wbuf.nbytes + n2; err := ESUCCESS} else abort⟫ (# wbuf.content = EB_PAGE_SIZE ∧ m4 < # avol ∧ wbuf-cons(wbuf, avol[m4], rofs) ∧ ebm-vol-inv(avol) ∧ # lpt = # avol)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ nobuffer ≠ buffered(m); (s)% ⊦ mkwbuf(buf, m, m0).offset = m; (s)% ⊦ mkwbuf(buf, m, m0).nbytes = m0; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic