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

# buf = (n2 + n1) * LEB_SIZE, buf0 = buf, m = 0, m0 = n3 + n1, n = LEB_SIZE, n0 = n1 * LEB_SIZE, subarray(buf, 0, n1 * LEB_SIZE) = lebs(avol, n3, n1), ebm-vol-inv(avol), mapped-full?(avol, n3, n2 + n1), n3 + n2 + n1 ≤ # avol, m0 < # avol → m0 < # avol ⊦ ⟪abort; n := n1 + 1⟫ ( n ≤ n2 + n1 ∧ # buf0 = (n2 + n1) * LEB_SIZE ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → subarray(buf0, 0, n * LEB_SIZE) = lebs(avol, n3, n)) ∧ n1 < n), n2 = 0, m0 < # avol ∧ avol[m0].mapped? ∧ n0 + n ≤ # buf0 ∧ m + n ≤ LEB_SIZE

Heuristic symbolic execution applied rule abort right

And obtained the following new goals

Proof step 39:
# buf = (n2 + n1) * LEB_SIZE, buf0 = buf, m = 0, m0 = n3 + n1, n = LEB_SIZE, n0 = n1 * LEB_SIZE, subarray(buf, 0, n1 * LEB_SIZE) = lebs(avol, n3, n1), ebm-vol-inv(avol), mapped-full?(avol, n3, n2 + n1), n3 + n2 + n1 ≤ # avol, m0 < # avol → m0 < # avol ⊦ n2 = 0, m0 < # avol ∧ avol[m0].mapped? ∧ n0 + n ≤ # buf0 ∧ m + n ≤ LEB_SIZE

Proof step 38 from proof prepost-read-lebs (previous step)

Heuristic symbolic execution applied rule abort right

And obtained the following new goals

Rule argument

Additional information