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

⟨awbuf_write_buf#(n, buf, adr, m, nx, lpt, ns, buffered(m1); avol, isbuf; err)⟩ (avol = avol1 ∧ (isbuf ↔ isbuf0) ∧ err = err0), # lpt = # avol, avol[m1] = mapped(buf0), ¬ isbuf, m1 < # avol, awbuf-inv(avol, buffered(m1)), avol0 ↓ avol1, n ≤ # buf, # buf0 + n ≤ LEB_SIZE, ¬ avol0 ↓ avol ⊦ ⟨fail_or_success#(; ; err); let m = buffered(m1).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}⟩ (synced(avol) ∧ avol0 ↓ avol)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 19:
⟨awbuf_write_buf#(n, buf, adr, m, nx, lpt, ns, buffered(m1); avol, isbuf; err)⟩ (avol = avol1 ∧ (isbuf ↔ isbuf0) ∧ err = err0), # lpt = # avol, avol[m1] = mapped(buf0), ¬ isbuf, m1 < # avol, awbuf-inv(avol, buffered(m1)), avol0 ↓ avol1, # buf0 + n ≤ LEB_SIZE, n ≤ # buf ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; let m = buffered(m1).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}⟩ (synced(avol) ∧ avol0 ↓ avol), avol0 ↓ avol

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};