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

# buf2 = EB_PAGE_SIZE, LEB_SIZE = n1 + logoff0, LEB_SIZE = n0 + # buf0, avol[m5] = mapped(buf0), copy(buf0 + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE) ≠ emptypage, n1 ≠ 0, m5 < # avol, logoff0 < LEB_SIZE, ebm-vol-inv(avol), is-aligned(logoff0, EB_PAGE_SIZE), is-encoded(log0, buf0), is-encoded(log, subarray(buf0, 0, logoff0)), logoff0 + EB_PAGE_SIZE ≤ LEB_SIZE, logoff0 ≤ # buf0, # buf0 ≤ LEB_SIZE ⊦ ⟪decode_ref_node#(EB_PAGE_SIZE, copy(avol[m5].data + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE); rnd; err0); if err0 = ESUCCESS then log := log + rnd.leb '; logoff := logoff0 + EB_PAGE_SIZE⟫ ( logoff ≤ LEB_SIZE ∧ is-aligned(logoff, EB_PAGE_SIZE) ∧ (err0 = ESUCCESS ∨ err0 = ENOENT ∨ ⌊err0⌋ ) ∧ avol[m5].mapped? ∧ (err0 = ESUCCESS → logoff ≤ # avol[m5].data ∧ is-encoded(log, subarray(avol[m5].data, 0, logoff))) ∧ (err0 = ENOENT → is-encoded(log, avol[m5].data)) ∧ LEB_SIZE < n1 + logoff)

User applied rule insert program lemma

And obtained the following new goals

Proof step 58:
EB_PAGE_SIZE ≤ # buf ⊦ ⟪decode_ref_node#(EB_PAGE_SIZE, buf; rnd; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → is-encoded(rnd, subarray(buf, 0, EB_PAGE_SIZE))))
Proof step 59:
# buf2 = EB_PAGE_SIZE, LEB_SIZE = n0 + # buf0, LEB_SIZE = n1 + logoff0, avol[m5] = mapped(buf0), buf1 = copy(avol[m5].data + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE), logoff0 < LEB_SIZE, m5 < # avol, ebm-vol-inv(avol), is-aligned(logoff0, EB_PAGE_SIZE), is-encoded(log, subarray(buf0, 0, logoff0)), is-encoded(log0, buf0), # buf0 ≤ LEB_SIZE, logoff0 ≤ # buf0, logoff0 + EB_PAGE_SIZE ≤ LEB_SIZE, EB_PAGE_SIZE ≤ # copy(avol[m5].data + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE) ⊦ [decode_ref_node#(EB_PAGE_SIZE, copy(avol[m5].data + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE); rnd; err0)] ( (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → is-encoded(rnd, subarray(buf1, 0, EB_PAGE_SIZE))) → ⟪if err0 = ESUCCESS then log := log + rnd.leb '; logoff := logoff0 + EB_PAGE_SIZE⟫ ( logoff ≤ LEB_SIZE ∧ is-aligned(logoff, EB_PAGE_SIZE) ∧ (err0 = ESUCCESS ∨ err0 = ENOENT ∨ ⌊err0⌋ ) ∧ avol[m5].mapped? ∧ (err0 = ESUCCESS → logoff ≤ # avol[m5].data ∧ is-encoded(log, subarray(avol[m5].data, 0, logoff))) ∧ (err0 = ENOENT → is-encoded(log, avol[m5].data)) ∧ LEB_SIZE < n1 + logoff)), copy(buf0 + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE) = emptypage, n1 = 0

Rule argument

spec: encoding-page-size-nonempty, inst: encoding-ref-node name: decode-contract seq: EB_PAGE_SIZE ≤ # buf ⊦ ⟪decode_ref_node#(EB_PAGE_SIZE, buf; rnd; err)⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → is-encoded(rnd, subarray(buf, 0, EB_PAGE_SIZE)))) subst: [buf, rnd, err] → [copy (avol[m5].data + mkempbuf(n0), logoff0, buf2, 0, EB_PAGE_SIZE), rnd, err0] flags: <all paths>

Additional information

Used simplifier rules: ⊦ m ≤ n → (n ≤ m ↔ m = n); (s)% ⊦ # mkempbuf(n) = n; (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ m ≠ n → (m ≤ n ↔ m < n); (s)% ⊦ # copy(buf, m, buf0, m0, n) = # buf0; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat% ⊦ EB_PAGE_SIZE ≠ 0; (s)% ⊦ m < n → n ≠ 0; (s)% ⊦ ¬ n < n; (s)%# buf ≤ n, n + m1 ≤ # buf + # buf0 ⊦ copy(buf + buf0, n, buf1, m0, m1) = copy(buf0, n - # buf, buf1, m0, m1); (s)%append-a: ⊦ (buf + buf0) + buf1 = buf + buf0 + buf1; from specification array-splice[buffer]%# buf = n ⊦ subarray(buf, 0, n) = buf; (s)% ⊦ is-encoded(nx0, buf) → (is-encoded(nx1, buf) ↔ nx0 = nx1); (s)% ⊦ m < n → ¬ n < m; (s)