[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 5 from proof term-restore-log (previous step)

jvalid ↔ boolvar0, err = ESUCCESS, fi0 = ri, gstore = gstore1, gstore0 = gstore2, jro = ginval, log = [], nx = nx1, nx0 = nx2, p_os = ns, pmaxino = maxino, elems nx2 ∩ ginval = ∅, inv(gstore2), elems nx2 ⊆ dom gstore2 ⊦ ⟪while nx0 ≠ [] ∧ err = ESUCCESS do {/* (term-restore-log: invariant elems nx0 ⊆ dom gstore0 ∧ elems nx0 ∩ jro = ∅ ∧ inv(gstore0) wfbound # nx0) */; gjournal_remove_nonend_blocks#(nx0.head, fi0, fi, jro, gstore0, gstore, nx, pmaxino, p_os, jvalid; log; err); nx0 := nx0.tail}⟫ true

Heuristic symbolic execution applied rule annotation right

And obtained the following new goals

Proof step 6:
jvalid ↔ boolvar0, err = ESUCCESS, err0 = ESUCCESS, fi0 = ri, gstore = gstore1, gstore0 = gstore2, jro = ginval, log0 = [], nx = nx1, nx0 = nx3, nx4 = nx2, p_os = ns, pmaxino = maxino, elems nx2 ∩ ginval = ∅, elems nx0 ∩ jro = ∅, inv(gstore2), inv(gstore0), elems nx2 ⊆ dom gstore2, elems nx0 ⊆ dom gstore0 ⊦ ⟪gjournal_remove_nonend_blocks#(nx0.head, fi0, fi, jro, gstore0, gstore, nx, pmaxino, p_os, jvalid; log; err); nx0 := nx0.tail⟫ ((elems nx0 ⊆ dom gstore0 ∧ elems nx0 ∩ jro = ∅ ∧ inv(gstore0)) ∧ # nx0 < # nx3), nx0 = []

Rule argument

rule: invariant right arg: bound: # nx0 inv: elems nx0 ⊆ dom gstore0 ∧ elems nx0 ∩ jro = ∅ ∧ inv(gstore0) fmapos: right 1 pos: right 1

Additional information

Used formulas: elems nx0 ⊆ dom gstore0 ∧ elems nx0 ∩ jro = ∅ ∧ inv(gstore0), # nx0 = # nx0