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

m12 + 1 = fs[ri[inodekey(m0)]].nlink, 0 = fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m9)]] = inodenode(key2, md4, true, m7, m8, m14 + 1), fs[ri[dentrykey(m4, str0)]] = dentrynode(key0, m0), fs[ri[dentrykey(m9, str)]] = dentrynode(key, m), fs[ri[inodekey(m4)]] = inodenode(key1, md3, true, m1, m3, m6), fs[ri[inodekey(m)]] = inodenode(key3, md5, false, m10, 0, m13), dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode = mkinode(m0, md0, false, m12 + 1, 0, m5), new_inode = mkinode(m4, md1, true, m1, m3, m6), old_dent0 = mkdentry(str, m), old_dent1 = mkdentry(str0, m0), old_dent_inode = mkinode(m, md, false, m10, 0, m2), old_inode = mkinode(m9, md2, true, m7, m8, m14 + 1), m0 ≠ ROOT_INO, m0 ≠ 0, m4 ≠ 0, m9 ≠ m4, m9 ≠ 0, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m9, str) ∈ ri, ri[dentrykey(m9, str)] ∈ fs, dentrykey(m4, str0) ∈ ri, ri[dentrykey(m4, str0)] ∈ fs, inodekey(m4) ∈ ri, ri[inodekey(m4)] ∈ fs, inodekey(m0) ∈ ri, ri[inodekey(m9)] ∈ fs, inodekey(m9) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, ⌊err0⌋ , ¬ fs[ri[inodekey(m0)]].directory, boolvar2 → boolvar0, m12 = 0 → links(m0, fs, ri) = ∅ ++ dentrykey(m4, str0), m1 ≠ 0 ∨ m4 = ROOT_INO, m7 ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar2)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar2 → boolvar1) ∧ mkinode(m9, md2, true, m7, m8, m14 + 1) = old_inode ∧ mkinode(m4, md1, true, m1, m3, m6) = new_inode ∧ mkinode(m, md, false, m10, 0, m2) = old_dent_inode ∧ mkinode(m0, md0, false, m12 + 1, 0, m5) = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ mkdentry(str0, m0) = old_dent1 ∧ err0 = err1), m7 = 0 ∧ m9 ≠ ROOT_INO, m1 = 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 };