[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 123 from proof refine-rename-overwrite-reparent-file (previous step)

0 = fs0[ri0[inodekey(m0)]].nsubdirs, 1 = fs0[ri0[inodekey(m0)]].nlink, fs0[ri0[inodekey(m)]] = inodenode(key, md5, false, fs0[ri0[inodekey(m)]].nlink, 0, m12), fs0[ri0[inodekey(m4)]] = inodenode(key2, md4, true, m6, m7, m8), fs0[ri0[dentrykey(m4, str0)]] = dentrynode(key0, m0), fs0[ri0[dentrykey(m9, str)]] = dentrynode(key3, m), fs0[ri0[inodekey(m9)]] = inodenode(key1, md3, true, m1, m3, m14 + 1), dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), links(m0, fs0, ri0) = ∅ ++ dentrykey(m4, str0), new_dent_inode = mkinode(m0, md0, false, 1, 0, m5), new_inode = mkinode(m4, md1, true, m6, m7, m8), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m0), old_dent_inode = mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, 0, m2), old_inode = mkinode(m9, md2, true, m1, m3, m14 + 1), adr1 ≠ adr2, adr1 ≠ adr3, adr1 ≠ adr4, adr1 ≠ adr5, adr2 ≠ adr3, adr2 ≠ adr4, adr2 ≠ adr5, adr3 ≠ adr4, adr3 ≠ adr5, adr4 ≠ adr5, m0 ≠ ROOT_INO, m0 ≠ 0, m4 ≠ 0, m9 ≠ m4, m9 ≠ 0, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ]), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0) ++ inodekey(m0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0) ++ inodekey(m0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)][adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14)] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5], orphans(fs0, ri0) ++ inodekey(m0), fi, fo, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[dentrykey(m9, str)] ∈ fs0, ri0[inodekey(m9)] ∈ fs0, ri0[inodekey(m4)] ∈ fs0, ri0[dentrykey(m4, str0)] ∈ fs0, inodekey(m4) ∈ ri0, inodekey(m9) ∈ ri0, dentrykey(m4, str0) ∈ ri0, inodekey(m0) ∈ ri0, dentrykey(m9, str) ∈ ri0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, ¬ fs0[ri0[inodekey(m0)]].directory, ¬ fs0[ri0[inodekey(m)]].directory, ¬ adr4 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3], ¬ adr2 ∈ ri0 -- dentrykey(m9, str), ¬ adr5 ∈ fs0, ¬ adr4 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, ¬ adr3 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2], ¬ adr5 ∈ (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4], boolvar2 → boolvar0, m6 ≠ 0 ∨ m4 = ROOT_INO, m1 ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar2)⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)] [adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14) ] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]) ∧ files = abs-files (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)] [adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14) ] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]) ∧ orphans (fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), m)] [adr3, inodenode(inodekey(m9), md2, true, m1, m3, m14) ] [adr4, inodenode(inodekey(m4), md1, true, m6, m7, m8) ] [adr5, inodenode(inodekey(m0), md0, false, 0, 0, m5) ], (ri0 -- dentrykey(m9, str))[dentrykey(m4, str0), adr2][inodekey(m9), adr3][inodekey(m4), adr4][inodekey(m0), adr5]) = orphans(fs0, ri0) ++ inodekey(m0) ∧ (boolvar2 → boolvar1) ∧ mkinode(m9, md2, true, m1, m3, m14) = old_inode ∧ mkinode(m4, md1, true, m6, m7, m8) = new_inode ∧ mkinode(m, md, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) = old_dent_inode ∧ mkinode(m0, md0, false, 0, 0, m5) = new_dent_inode ∧ negdentry(str) = old_dent0 ∧ mkdentry(str0, m) = old_dent1 ∧ ESUCCESS = err0), m1 = 0 ∧ m9 ≠ ROOT_INO, m6 = 0 ∧ m4 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_rename# (; OLD_PARENT_INODE, NEW_PARENT_INODE, OLD_CHILD_INODE, NEW_CHILD_INODE, OLD_DENT, NEW_DENT, ERR, DIRS, FILES ; ASYNCED ) {if pre-rename (OLD_PARENT_INODE, OLD_DENT, OLD_CHILD_INODE, NEW_PARENT_INODE, NEW_DENT, NEW_CHILD_INODE, DIRS, FILES) then { let OLD_INO = OLD_PARENT_INODE.ino, NEW_INO = NEW_PARENT_INODE.ino, OVERWRITE = NEW_DENT.dentry? in let IDENTITY = OLD_INO = NEW_INO ∧ NEW_DENT = OLD_DENT in {DIRS[OLD_INO].entries := DIRS[OLD_INO].entries -- OLD_DENT.name; if ¬ IDENTITY then {DIRS[OLD_INO].size := DIRS[OLD_INO].size - 1; if OLD_DENT.ino ∈ DIRS then DIRS[OLD_INO].nsubdirs := DIRS[OLD_INO].nsubdirs - 1}; DIRS[NEW_INO].entries[NEW_DENT.name] := OLD_DENT.ino; if OVERWRITE ∧ ¬ IDENTITY then let INO = NEW_DENT.ino in afs_drop_nlink#(INO; DIRS, FILES); if ¬ OVERWRITE then {DIRS[NEW_INO].size := DIRS[NEW_INO].size + 1; if OLD_DENT.ino ∈ DIRS then DIRS[NEW_INO].nsubdirs := DIRS[NEW_INO].nsubdirs + 1}; NEW_DENT := mkdentry(NEW_DENT.name, OLD_DENT.ino); OLD_DENT := negdentry(OLD_DENT.name); afs_inode_sync#(OLD_PARENT_INODE; DIRS, FILES); afs_inode_sync#(NEW_PARENT_INODE; DIRS, FILES); if OVERWRITE then {afs_inode_sync#(NEW_CHILD_INODE; DIRS, FILES); NEW_CHILD_INODE := getinode(NEW_CHILD_INODE.ino, DIRS, FILES)}; OLD_PARENT_INODE := getinode(OLD_PARENT_INODE.ino, DIRS, FILES); NEW_PARENT_INODE := getinode(NEW_PARENT_INODE.ino, DIRS, FILES); ERR := ESUCCESS} or fail#(; ; ERR); ASYNCED := ?} else abort };