[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 10 from proof inv-read-gnd (previous step)

# lpt = # avol, # lpt0 = # avol, avol[m4] = mapped(buf1), buf = mkbuf(m2), buf0 = buf, log = log0, m0 = m3, m1 = m4, n = m2, m4 < # avol, abs-node(subarray(buf1, m3, m2), gnd), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), m3 + m2 ≤ # buf1 ⊦ ⟪if m1 < # avol ∧ n ≤ # buf0 ∧ m0 + n ≤ LEB_SIZE ∧ avol[m1].mapped? then {fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m1].data + mkempbuf(LEB_SIZE - # avol[m1].data), m0, buf0, 0, n) else choose buf with # buf = # buf0 ∧ range=(buf, n, buf0, n, # buf0 - n) in buf0 := buf} else abort; if err = ESUCCESS then decode_group_node#(0, m2, buf0; gnd0; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → gnd = gnd0))

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 11:
# lpt0 = # avol, # lpt = # avol, avol[m4] = mapped(buf1), buf = mkbuf(m2), buf0 = buf, log = log0, m0 = m3, m1 = m4, n = m2, m4 < # avol, abs-node(subarray(buf1, m3, m2), gnd), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), m3 + m2 ≤ # buf1 ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m1].data + mkempbuf(LEB_SIZE - # avol[m1].data), m0, buf0, 0, n) else choose buf with # buf = # buf0 ∧ range=(buf, n, buf0, n, # buf0 - n) in buf0 := buf; if err = ESUCCESS then decode_group_node#(0, m2, buf0; gnd0; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → gnd = gnd0))

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ # mkbuf(n) = n; (s)% ⊦ m ≤ m; (s)% ⊦ mapped(buf).mapped?; (s)% ⊦ m ≤ n ↔ ¬ n < m; (ss)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic%fle: ⊦ m < n ∧ n ≤ n0 → m < n0; (forward) from specification nat%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% ⊦ m < n → n ≠ 0; (s)%⊦ awbuf-inv(avol, bleb) ∧ n < # avol ∧ avol[n] = mapped(buf) → ¬ LEB_SIZE < # buf; (s)