[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 16 from proof prepost-write-lebs (previous step)

# avol = # avol1, # buf = (n2 + n1) * LEB_SIZE, # avol1 = n3 + n0 + n2 + n1, lebs(avol, n0, n1) = subarray(buf, 0, n1 * LEB_SIZE), n3 + n2 ≠ 0, n2 ≠ 0, n0 + n1 < # avol1, ebm-vol-inv(avol1), ebm-vol-inv(avol), mapped-full?(avol, n0, n1), range=(avol, n0 + n2 + n1, avol1, n0 + n2 + n1, n3), range=(avol, 0, avol1, 0, n0), n0 + n2 + n1 ≤ # avol1 ⊦ [ebm_avol_remap#(n0 + n1; avol; err)] ( ebm-vol-inv(avol) → ⟪n := n1; if err = ESUCCESS then ebm_avol_write#(n0 + n, 0, n * LEB_SIZE, LEB_SIZE, buf; avol; err); n := n + 1⟫ ( n ≤ n2 + n1 ∧ ebm-vol-inv(avol) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ # avol = # avol1 ∧ range=(avol, 0, avol1, 0, n0) ∧ range=(avol, n0 + n2 + n1, avol1, n0 + n2 + n1, n3) ∧ (err = ESUCCESS → lebs(avol, n0, n) = subarray(buf, 0, n * LEB_SIZE) ∧ mapped-full?(avol, n0, n)) ∧ n1 < n))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 17:
# avol1 = n3 + n0 + n2 + n1, # buf = (n2 + n1) * LEB_SIZE, # avol = # avol1, lebs(avol, n0, n1) = subarray(buf, 0, n1 * LEB_SIZE), m = n0 + n1, n0 + n1 < # avol1, ebm-vol-inv(avol), ebm-vol-inv(avol1), mapped-full?(avol, n0, n1), range=(avol, 0, avol1, 0, n0), range=(avol, n0 + n2 + n1, avol1, n0 + n2 + n1, n3), n0 + n2 + n1 ≤ # avol1 ⊦ [if m < # avol then {fail_or_success#(; ; err); if err = ESUCCESS then avol[m] := mapped(mkbuf(0)) else {skip or avol[m] := unmapped}} else abort] ( ebm-vol-inv(avol) → ⟪n := n1; if err = ESUCCESS then ebm_avol_write#(n0 + n, 0, n * LEB_SIZE, LEB_SIZE, buf; avol; err); n := n + 1⟫ ( n ≤ n2 + n1 ∧ ebm-vol-inv(avol) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ # avol = # avol1 ∧ range=(avol, 0, avol1, 0, n0) ∧ range=(avol, n0 + n2 + n1, avol1, n0 + n2 + n1, n3) ∧ (err = ESUCCESS → lebs(avol, n0, n) = subarray(buf, 0, n * LEB_SIZE) ∧ mapped-full?(avol, n0, n)) ∧ n1 < n)), n3 + n2 = 0, n2 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ebm_avol_remap#(LNUM; AVOL; ERR) {if LNUM < # AVOL then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then AVOL[LNUM] := mapped(mkbuf(0)) else {skip or AVOL[LNUM] := unmapped}} else abort };