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

m = m1, 2 * NODE_HEADER_SIZE ≤ m1, n + m1 ≤ # buf, n + NODE_HEADER_SIZE ≤ # buf, err = ESUCCESS → is-encoded(ndhd, subarray(buf, n, NODE_HEADER_SIZE)), err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪if err = ESUCCESS ∧ align↑(ndhd.size, 2 * NODE_HEADER_SIZE) + 2 * NODE_HEADER_SIZE ≠ m then {debug#("persistence: decode_node node of wrong size"); err := EIO}; m0 := n; if err = ESUCCESS then {decode_node_headerless#(m0 + NODE_HEADER_SIZE, buf; nd, m; err); if err ≠ ESUCCESS then debug#("persistence: decode_node decoding failed") else if m ≠ ndhd.size then {debug#("persistence: decode_node size of node unexpected"); err := EINVAL}}; if err = ESUCCESS ∧ ¬ range=(buf, m0 + NODE_HEADER_SIZE + align↑(ndhd.size, 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) ∧ m1 = 2 * NODE_HEADER_SIZE + nd.alignedsize)), err = ESUCCESS ∧ ndhd.ispadding

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information