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

avol[m5] = mapped(buf0), buf = mkbuf(m0), err = ESUCCESS, log = [], logoff = 0, m = LEB_SIZE, m0 = EB_PAGE_SIZE, sb = mksb(adr, m6, m5, m1, m2, m3, m4), m5 < # avol, ebm-vol-inv(avol), is-encoded(log0, buf0) ⊦ ⟪while err = ESUCCESS ∧ logoff < m do {/* (prepost-read-log : invariant logoff ≤ LEB_SIZE ∧ # buf = m0 ∧ is-aligned(logoff, m0) ∧ (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ ebm-vol-inv(avol) ∧ sb.log < # avol ∧ avol[sb.log].mapped? ∧ (err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded(log, subarray(avol[sb.log].data, 0, logoff))) ∧ (err = ENOENT → is-encoded(log, avol[sb.log].data)) wfbound LEB_SIZE - logoff) */; ebm_avol_read#(sb.log, logoff, 0, m0, avol; buf; err); if err = ESUCCESS then if isempty(buf) then err := ENOENT else let rnd = ? in {decode_ref_node#(m0, buf; rnd; err); if err = ESUCCESS then log := log + rnd.leb}; logoff := logoff + m0}; if err = ENOENT then err := ESUCCESS⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → log = log0))

Heuristic annotation applied rule annotation right

And obtained the following new goals

Proof step 14:
# buf = m0, avol[m5] = mapped(buf0), buf1 = mkbuf(m0), err = ESUCCESS, err0 = ESUCCESS, log1 = [], logoff = logoff0, logoff1 = 0, m = LEB_SIZE, m0 = EB_PAGE_SIZE, sb = mksb(adr, m6, m5, m1, m2, m3, m4), avol[sb.log].mapped?, m5 < # avol, sb.log < # avol, logoff < m, ebm-vol-inv(avol), is-aligned(logoff, m0), is-encoded(log0, buf0), logoff ≤ LEB_SIZE, err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded(log, subarray(avol[sb.log].data, 0, logoff)), err = ENOENT → is-encoded(log, avol[sb.log].data), err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ⊦ ⟪ebm_avol_read#(sb.log, logoff, 0, m0, avol; buf; err); if err = ESUCCESS then if isempty(buf) then err := ENOENT else let rnd = ? in {decode_ref_node#(m0, buf; rnd; err); if err = ESUCCESS then log := log + rnd.leb}; logoff := logoff + m0⟫ ( ( logoff ≤ LEB_SIZE ∧ # buf = m0 ∧ is-aligned(logoff, m0) ∧ (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ ebm-vol-inv(avol) ∧ sb.log < # avol ∧ avol[sb.log].mapped? ∧ (err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded(log, subarray(avol[sb.log].data, 0, logoff))) ∧ (err = ENOENT → is-encoded(log, avol[sb.log].data))) ∧ LEB_SIZE - logoff < LEB_SIZE - logoff0)
Proof step 135:
# buf = m0, avol[m5] = mapped(buf0), buf1 = mkbuf(m0), err0 = ESUCCESS, log1 = [], logoff1 = 0, m = LEB_SIZE, m0 = EB_PAGE_SIZE, sb = mksb(adr, m6, m5, m1, m2, m3, m4), avol[sb.log].mapped?, m5 < # avol, sb.log < # avol, ebm-vol-inv(avol), is-aligned(logoff, m0), is-encoded(log0, buf0), logoff ≤ LEB_SIZE, err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded(log, subarray(avol[sb.log].data, 0, logoff)), err = ENOENT → is-encoded(log, avol[sb.log].data), err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ⊦ ⟪if err = ENOENT then err := ESUCCESS⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → log = log0)), err = ESUCCESS ∧ logoff < m

Rule argument

rule: invariant right arg: bound: LEB_SIZE - logoff inv: logoff ≤ LEB_SIZE ∧ # buf = m0 ∧ is-aligned(logoff, m0) ∧ (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ ebm-vol-inv(avol) ∧ sb.log < # avol ∧ avol[sb.log].mapped? ∧ ( err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded (log, subarray(avol[sb.log].data, 0, logoff))) ∧ (err = ENOENT → is-encoded(log, avol[sb.log].data)) fmapos: right 1 pos: right 1

Additional information

Used simplifier rules: ⊦ 0 ≤ m; (s)% ⊦ # mkbuf(n) = n; (s)% ⊦ EB_PAGE_SIZE ≠ 0; (s)%n ≠ 0 ⊦ is-aligned(0, n); (s)% ⊦ mksb(adr, m, m0, m1, m2, m3, m4).log = m0; (s)% ⊦ subarray(buf, n, 0) = mkbuf(0); (s)% ⊦ is-encoded([], buf) ↔ buf = mkbuf(0); (s)% ⊦ ESUCCESS ≠ ENOENT; (s)% ⊦ aleb.mapped? ↔ aleb ≠ unmapped; (ss)% ⊦ unmapped ≠ mapped(buf); (s) Used formulas: logoff ≤ LEB_SIZE ∧ # buf = m0 ∧ is-aligned(logoff, m0) ∧ (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ ebm-vol-inv(avol) ∧ sb.log < # avol ∧ avol[sb.log].mapped? ∧ ( err = ESUCCESS → logoff ≤ # avol[sb.log].data ∧ is-encoded(log, subarray(avol[sb.log].data, 0, logoff))) ∧ (err = ENOENT → is-encoded(log, avol[sb.log].data)), LEB_SIZE - logoff = LEB_SIZE - logoff