[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 5 from proof crash-neutral-write-buf (previous step)

# lpt = # avol, adr = adr0, n0 = n, ns = ns0, nx = nx0, awbuf-inv(avol, bleb), synced(avol0), avol0 ↓ avol, # avol[bleb.leb].data + n0 ≤ LEB_SIZE, n0 ≤ # buf, # avol[bleb.leb].data + n ≤ LEB_SIZE, n ≤ # buf, bleb ≠ nobuffer → avol[bleb.leb].mapped? ∧ bleb.leb < # avol ∧ bleb.isbuf? ⊦ ⟨if isbuf then err := EROFS else {fail_or_success#(; ; err); let m = bleb.leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n0)) else { choose n with n ≠ 0 ∧ n < n0 ∧ is-aligned(# avol[m].data + n, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) ifnone skip or skip; isbuf := true}}⟩ (avol0 ↓ avol), bleb = nobuffer

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 6:
# lpt = # avol, avol[n0] = mapped(buf0), n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, # buf0 + n ≤ LEB_SIZE, n ≤ # buf ⊦ ⟨if isbuf then err := EROFS else {fail_or_success#(; ; err); let m = buffered(n0).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}}⟩ (avol0 ↓ avol)

Rule argument

Additional information

Used simplifier rules: fwd-buffered-mapped: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol ∧ avol[n].mapped?;% ⊦ mapped(buf) = mapped(buf0) ↔ buf = buf0; (s)%inv-buf-in-vol: ⊦ awbuf-inv(avol, buffered(n)) → n < # avol; (forward) from specification awbuf-inv% ⊦ mapped(buf).data = buf; (s)% ⊦ nobuffer ≠ buffered(m); (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ buffered(m).leb = m; (s)%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ bleb.isbuf? ↔ (∃ n. bleb = buffered(n)); (as)% ⊦ aleb.mapped? ↔ (∃ buf. aleb = mapped(buf)); (as)