[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 73 from proof decode-node (previous step)

node-size-headerless(nd) ≠ m0, is-encoded(nd, subarray(buf, n + NODE_HEADER_SIZE, node-size-headerless(nd))), is-encoded(nodeheader(m0, false), subarray(buf, n, NODE_HEADER_SIZE)), (n + NODE_HEADER_SIZE) + node-size-headerless(nd) ≤ # buf, n + align↑(m0, 2 * NODE_HEADER_SIZE) + 2 * NODE_HEADER_SIZE ≤ # buf, n + NODE_HEADER_SIZE ≤ # buf ⊦ ⟪debug#("persistence: decode_node size of node unexpected"); err := EINVAL; if err = ESUCCESS ∧ ¬ range=(buf, n + NODE_HEADER_SIZE + align↑(m0, 2 * NODE_HEADER_SIZE), validtrailer, 0, NODE_HEADER_SIZE) then {debug#("persistence: decode_node no validtrailer"); err := EIO}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ buf0, buf1. subarray(buf, n, 2 * NODE_HEADER_SIZE + nd.alignedsize) = buf0 + buf1 + validtrailer ∧ is-encoded(nodeheader(node-size-headerless(nd), false), buf0) ∧ is-encoded(nd, subarray(buf1, 0, node-size-headerless(nd))) ∧ # buf1 = nd.alignedsize) ∧ align↑(m0, 2 * NODE_HEADER_SIZE) = nd.alignedsize))

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: decode_node size of node unexpected"] flags: <all paths>

Additional information