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

n0 = n, vtbl = ∅, is-encoded(vtbl0, buf), err = ESUCCESS → is-encoded(n1, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ ENCODED_NAT_SIZE ≤ # buf ∧ n = ENCODED_NAT_SIZE, err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪while n1 ≠ 0 ∧ err = ESUCCESS do {/* (decode : invariant (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n1` ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n1` * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n1`, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec(vtbl, subarray(buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec(vtbl1, subarray(buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))))) wfbound n1) */; let v = ?, m = ? in {decode_volid#(n0, buf; v, n; err); if err = ESUCCESS then {n0 := n0 + n; decode_nat#(n0, buf; m, n; err); if err = ESUCCESS then {n0 := n0 + n; vtbl[v] := m}}}; n1 := n1 - 1}⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → vtbl = vtbl0))

Heuristic annotation applied rule annotation right

And obtained the following new goals

Proof step 14:
n0 = n, vtbl = ∅, is-encoded(vtbl0, buf), err = ESUCCESS → is-encoded(n1, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ ENCODED_NAT_SIZE ≤ # buf ∧ n = ENCODED_NAT_SIZE, err = ESUCCESS ∨ ⌊err⌋ ⊦ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n1 ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n1, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec(vtbl, subarray(buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec(vtbl1, subarray(buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE)))))
Proof step 17:
err = ESUCCESS, n1 = n2, n4 = n3, vtbl2 = ∅, is-encoded(vtbl0, buf), err0 = ESUCCESS → is-encoded(n5, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ ENCODED_NAT_SIZE ≤ # buf ∧ n3 = ENCODED_NAT_SIZE, err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n5 ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n5 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n5, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec(vtbl, subarray(buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec(vtbl1, subarray(buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE)))), err0 = ESUCCESS ∨ ⌊err0⌋ , err = ESUCCESS ∨ ⌊err⌋ ⊦ ⟪let v = ?, m = ? in {decode_volid#(n0, buf; v, n; err); if err = ESUCCESS then {n0 := n0 + n; decode_nat#(n0, buf; m, n; err); if err = ESUCCESS then {n0 := n0 + n; vtbl[v] := m}}}; n1 := n1 - 1⟫ ( ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n5 ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n5 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n5, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec(vtbl, subarray(buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec(vtbl1, subarray(buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE)))))) ∧ n1 < n2), n1 = 0
Proof step 86:
n4 = n3, vtbl2 = ∅, is-encoded(vtbl0, buf), err0 = ESUCCESS → is-encoded(n5, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ ENCODED_NAT_SIZE ≤ # buf ∧ n3 = ENCODED_NAT_SIZE, err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n5 ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n5 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n5, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec(vtbl, subarray(buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec(vtbl1, subarray(buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE)))), err0 = ESUCCESS ∨ ⌊err0⌋ , err = ESUCCESS ∨ ⌊err⌋ ⊦ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → vtbl = vtbl0), n1 ≠ 0 ∧ err = ESUCCESS

Rule argument

rule: invariant right arg: bound: n1 inv: (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n1` ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n1` * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded (n1`, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec (vtbl, subarray (buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec (vtbl1, subarray (buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))))) fmapos: right 1 pos: right 1

Additional information

Used formulas: (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ vtbl1. vtbl ⊥ vtbl1 ∧ # vtbl1 + # vtbl = n1` ∧ # vtbl1 = n1 ∧ # buf ≥ ENCODED_NAT_SIZE + n1` * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ n0 = ENCODED_NAT_SIZE + # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE) ∧ is-encoded(n1`, subarray(buf, 0, ENCODED_NAT_SIZE)) ∧ is-encoded-rec (vtbl, subarray (buf, ENCODED_NAT_SIZE, # vtbl * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))) ∧ is-encoded-rec (vtbl1, subarray (buf, n0, # vtbl1 * (ENCODED_VOLID_SIZE + ENCODED_NAT_SIZE))))), n1 = n1