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

# 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))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 12:
# lpt0 = # avol, # lpt = # avol, avol[m4] = mapped(buf1), 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); buf := mkbuf(m2); if err = ESUCCESS then buf := copy(avol[m4].data + mkempbuf(LEB_SIZE - # avol[m4].data), m3, buf, 0, m2) else {n := m2; choose buf1 with # buf1 = # buf ∧ range=(buf1, n, buf, n, # buf - n) in buf := buf1}; if err = ESUCCESS then decode_group_node#(0, m2, buf; gnd0; err)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → gnd = gnd0))

Rule argument

Additional information

Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic