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

fs[ri[inodekey(p_ino)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(p_ino) ∈ ri, ¬ inodekey(p_ino) ∈ ro, fs[ri[inodekey(p_ino)]].nlink ≠ 0 ∨ p_ino = ROOT_INO ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then {boolvar := dentrykey(p_ino, dent.name) ∈ ri; if boolvar then nd := fs[ri[dentrykey(p_ino, dent.name)]] else nd := ?} else boolvar := ?, nd := ?; if err = ESUCCESS then if boolvar then dent := mkdentry(dent.name, nd.ino), err := ESUCCESS else dent := negdentry(dent.name), err := ENOENT⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 13:
fs[ri[inodekey(p_ino)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(p_ino) ∈ ri, fs[ri[inodekey(p_ino)]].nlink ≠ 0 ∨ p_ino = ROOT_INO ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then {boolvar := dentrykey(p_ino, dent.name) ∈ ri; if boolvar then nd := fs[ri[dentrykey(p_ino, dent.name)]] else nd := ?} else boolvar := ?, nd := ?; if err = ESUCCESS then if boolvar then dent := mkdentry(dent.name, nd.ino), err := ESUCCESS else dent := negdentry(dent.name), err := ENOENT⟫ true, inodekey(p_ino) ∈ ro

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};