[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 6 from proof inv-add3 (previous step)

adr = adr1, adr4 = adr2, nd = nd2, nd1 = nd3, fo.inodes?, ro.inodes?, log-cons(log, fs), node-cons(nd2.key, nd2), node-cons(nd0.key, nd0), node-cons(nd3.key, nd3), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri) ⊦ ⟪choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC; boolvar := ?⟫ (log-cons(log, fs) ∧ ri-cons(ri, fs))

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 7:
adr = adr5, adr4 = adr6, nd = nd2, nd1 = nd3, ro.inodes?, fo.inodes?, log-cons(log, fs), new(adr1 ' + (adr2 ' + adr3), fs), node-cons(nd3.key, nd3), node-cons(nd0.key, nd0), node-cons(nd2.key, nd2), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi) ⊦ ⟪adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS; boolvar := ?⟫ (log-cons(log, fs) ∧ ri-cons(ri, fs)), dups(adr1 ' + adr2 ' + adr3 ')
Proof step 39:
adr = adr1, adr4 = adr2, nd = nd2, nd1 = nd3, ro.inodes?, fo.inodes?, log-cons(log, fs), node-cons(nd3.key, nd3), node-cons(nd0.key, nd0), node-cons(nd2.key, nd2), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ∀ adr1, adr2, adr3. ¬(new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ')) ⊦ ⟪err := ENOSPC; boolvar := ?⟫ (log-cons(log, fs) ∧ ri-cons(ri, fs))

Proof step 6 from proof inv-add3 (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information