[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 18 from proof refine-gc (previous step)

# kx = # ax, fs = fs0[ax, fs0[ri0[kx]]], log = log0 + ax, ri = ri0[kx, ax], ax.toSet ∩ log0.toSet = ∅, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), new(ax, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), kx.toSet ⊆ dom ri0, asynced → boolvar ⊦ [choose as with as ∩ range ri = ∅ ∧ log.toSet ∩ as = ∅ in fs := fs \ as; boolvar := ?] ( ubifs-cons(fs, ri0[kx, ax], orphans(fs0, ri0), fi, fo, log0 + ax) ∧ replay-cons-strong(fs, ri0[kx, ax], orphans(fs0, ri0), fi, fo, log0 + ax) ∧ file-node-cons(fs, ri0[kx, ax]) ∧ orphans-cons(fs, ri0[kx, ax], orphans(fs0, ri0)) ∧ ri-inj(ri0[kx, ax]) ∧ log-cons(log0, fs) ∧ log-cons(ax, fs) → ⟨asynced := ?⟩ ( abs-dirs(fs0, ri0) = abs-dirs(fs, ri0[kx, ax]) ∧ abs-files(fs0, ri0) = abs-files(fs, ri0[kx, ax]) ∧ orphans(abs-dirs(fs, ri0[kx, ax]), abs-files(fs, ri0[kx, ax])) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar))), dups(kx), dups(ax)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information