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

1 = fs0[ri0[inodekey(m2)]].nlink, fs0[ri0[inodekey(m2)]] = inodenode(key1, md2, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size), fs0[ri0[dentrykey(m, str)]] = dentrynode(key, m2), fs0[ri0[inodekey(m)]] = inodenode(key0, md1, true, m3, m0 + 1, m1 + 1), abs-children(m2, fs0, ri0) = ∅, dentrykeys(inodekey(m2), ri0) = ∅, dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), links(m2, fs0, ri0) = ∅ ++ dentrykey(m, str), old_dent = mkdentry(str, m2), p_inode0 = mkinode(m, md, true, m3, m0 + 1, m1 + 1), p_inode1 = mkinode(m2, md0, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size), adr1 ≠ adr3, adr1 ≠ adr2, adr2 ≠ adr3, m ≠ 0, m2 ≠ 0, m2 ≠ ROOT_INO, fs0[ri0[inodekey(m2)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ri-inj((ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ri0[inodekey(m2)] ∈ fs0, inodekey(m2) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, dentrykey(m, str) ∈ ri0, ¬ adr1 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr3 ∈ fs0, asynced → boolvar0, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO, m3 ≠ 0 ∨ m = ROOT_INO ⊦ ⟨afs_rmdir#(; p_inode0, p_inode1, old_dent, err0, dirs, files; asynced)⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) ∧ files = abs-files (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) ∧ orphans (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) = orphans(fs0, ri0) ++ inodekey(m2) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, m3, m0, m1) = p_inode0 ∧ mkinode(m2, md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) = p_inode1 ∧ negdentry(str) = old_dent ∧ ESUCCESS = err0), m3 = 0 ∧ m ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 150:
1 = fs0[ri0[inodekey(m2)]].nlink, fs0[ri0[inodekey(m)]] = inodenode(key0, md1, true, m3, m0 + 1, m1 + 1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key, m2), fs0[ri0[inodekey(m2)]] = inodenode(key1, md2, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size), abs-children(m2, fs0, ri0) = ∅, c_inode = p_inode1, dent = old_dent, dentrykeys(inodekey(m2), ri0) = ∅, dirs = abs-dirs(fs0, ri0), err = err0, files = abs-files(fs0, ri0), links(m2, fs0, ri0) = ∅ ++ dentrykey(m, str), old_dent = mkdentry(str, m2), p_inode = p_inode0, p_inode0 = mkinode(m, md, true, m3, m0 + 1, m1 + 1), p_inode1 = mkinode(m2, md0, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size), fs0[ri0[inodekey(m2)]].directory, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3], orphans(fs0, ri0) ++ inodekey(m2), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(m, str) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m2) ∈ ri0, ri0[inodekey(m2)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, asynced → boolvar0, m3 ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨if pre-rmdir(p_inode, c_inode, dent, dirs, files) then { let p_ino = p_inode.ino in {dirs[p_ino].entries := dirs[p_ino].entries -- dent.name; dirs[p_ino].size := dirs[p_ino].size - 1; dirs[p_ino].nsubdirs := dirs[p_ino].nsubdirs - 1; let ino = dent.ino in afs_drop_nlink#(ino; dirs, files); dent := negdentry(dent.name); afs_inode_sync#(p_inode; dirs, files); afs_inode_sync#(c_inode; dirs, files); p_inode := getinode(p_inode.ino, dirs, files); c_inode := getinode(c_inode.ino, dirs, files); err := ESUCCESS} or fail#(; ; err); asynced := ?} else abort⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) ∧ files = abs-files (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) ∧ orphans (fs0[adr1, inodenode(inodekey(m), md, true, m3, m0, m1)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m2), md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m2), adr3]) = orphans(fs0, ri0) ++ inodekey(m2) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, m3, m0, m1) = p_inode ∧ mkinode(m2, md0, true, 0, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size) = c_inode ∧ negdentry(str) = dent ∧ ESUCCESS = err), adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, m2 = 0, m2 = ROOT_INO, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, m3 = 0 ∧ m ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_rmdir#(; P_INODE, C_INODE, DENT, ERR, DIRS, FILES; ASYNCED) {if pre-rmdir(P_INODE, C_INODE, DENT, DIRS, FILES) then { let P_INO = P_INODE.ino in {DIRS[P_INO].entries := DIRS[P_INO].entries -- DENT.name; DIRS[P_INO].size := DIRS[P_INO].size - 1; DIRS[P_INO].nsubdirs := DIRS[P_INO].nsubdirs - 1; let INO = DENT.ino in afs_drop_nlink#(INO; DIRS, FILES); DENT := negdentry(DENT.name); afs_inode_sync#(P_INODE; DIRS, FILES); afs_inode_sync#(C_INODE; DIRS, FILES); P_INODE := getinode(P_INODE.ino, DIRS, FILES); C_INODE := getinode(C_INODE.ino, DIRS, FILES); ERR := ESUCCESS} or fail#(; ; ERR); ASYNCED := ?} else abort };