[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 133 from proof inv-read-gblock-nodes (previous step)

# lpt0 = # avol, # lpt = # avol, # gndx = # lax, LEB_SIZE = n0 + # buf1, avol[m5] = mapped(buf1), m1 < LEB_SIZE, m5 < # avol, abs-nodes(buf1, gndx, lax, true), awbuf-inv(avol, bleb), buf-ro-rw-mode(isbuf, bleb, lpt0, avol), bufs-log-only(bleb, log0, lpt0), is-encoded(nodeheader(m2, false), subarray(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE)), lpt-free-unref(lpt), lpt-leb-size(lpt), lpt-ram-flash(lpt0, lpt, log0), range=(buf1 + mkempbuf(n0), m1 + NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE), read-gblock-inv(m5, m1, ax, gndx0, ax1, gndx2, buf1, false), m1 + 2 * NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE) ≤ LEB_SIZE, # buf1 ≤ LEB_SIZE, m1 + NODE_HEADER_SIZE ≤ LEB_SIZE, ⌊err⌋ , ¬ isempty(buf1 + mkempbuf(n0), m1, NODE_HEADER_SIZE) ⊦ ⟪debug#("persistence: read_gblock_nodes could not decode node at offset " + m1.toString + " in LEB " + m5.toString); m0 := m1; if err = ESUCCESS then m0 := m0 + 2 * NODE_HEADER_SIZE + align↑(m2, 2 * NODE_HEADER_SIZE)⟫ (err = ENOENT → read-gblock-inv(m5, m0, ax, gndx0, ax1, gndx2, avol[m5].data, true))

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: debug name: debug seq: ⊦ ⟪debug#(str)⟫ true subst: [str] → [ "persistence: read_gblock_nodes could not decode node at offset " + m1.toString + " in LEB " + m5.toString] flags: <all paths>

Additional information