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

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 ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, m2 = 0, m2 = ROOT_INO, pre-rmdir(p_inode, c_inode, dent, dirs, files), adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, m3 = 0 ∧ m ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 369:
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) = ∅, links(m2, fs0, ri0) = ∅ ++ dentrykey(m, str), 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, asynced → boolvar0, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO, m3 ≠ 0 ∨ m = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, m2 = ROOT_INO, m2 = 0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, m3 = 0 ∧ m ≠ ROOT_INO, str ∈ abs-dirs(fs0, ri0)[m].entries ∧ m2 = abs-dirs(fs0, ri0)[m].entries[str] ∧ m3 = abs-dirs(fs0, ri0)[m].nlink ∧ m1 + 1 = abs-dirs(fs0, ri0)[m].size ∧ m0 + 1 = abs-dirs(fs0, ri0)[m].nsubdirs

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)%⊦ valid-dir-inode(inode, dirs, files) ↔ valid-dir-ino(inode.ino, dirs, files) ∧ inode.nlink = dirs[inode.ino].nlink ∧ inode.size = dirs[inode.ino].size ∧ inode.nsubdirs = dirs[inode.ino].nsubdirs ∧ inode.directory; (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)%⊦ abs-dir(ino, fs, ri) = mkdir (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, fs[ri[inodekey(ino)]].nsubdirs, abs-children(ino, fs, ri)); (s)%⊦ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → abs-dirs(fs, ri)[ino] = abs-dir(ino, fs, ri); (s)% ⊦ dir-empty(ino, dirs, files) ↔ dirs[ino].entries = ∅; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkdentry(str, m).ino = m; (s)%⊦ pre-rmdir(p_inode, c_inode, dent, dirs, files) ↔ dent.ino ≠ ROOT_INO ∧ valid-dentry(p_inode.ino, dent, dirs, files) ∧ dir-empty(dent.ino, dirs, files) ∧ valid-dir-inode(p_inode, dirs, files) ∧ valid-dir-inode(c_inode, dirs, files) ∧ c_inode.ino = dent.ino; (s)