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

fs[ri[inodekey(m2)]].nsubdirs = m1 + 1, fs[ri[inodekey(m2)]].size = m0 + 1, 1 = fs[ri[inodekey(m)]].nlink, fs[ri[dentrykey(m2, str)]] = dentrynode(key, m), abs-children(m, fs, ri) = ∅, dentrykeys(inodekey(m), ri) = ∅, dirs = abs-dirs(fs, ri)[m2, mkdir(m0, fs[ri[inodekey(m2)]].meta, fs[ri[inodekey(m2)]].nlink, m1, abs-children(m2, fs, ri) -- str)], files = abs-files(fs, ri), links(m, fs, ri) = ∅ ++ dentrykey(m2, str), m ≠ 0, m ≠ ROOT_INO, m2 ≠ 0, fs[ri[inodekey(m2)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m2)]].inode?, fo.inodes?, orphans(fs, ri).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(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m2) ∈ ri, dentrykey(m2, str) ∈ ri, ri[dentrykey(m2, str)] ∈ fs, inodekey(m) ∈ ri, ri[inodekey(m2)] ∈ fs, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, fs[ri[inodekey(m2)]].nlink ≠ 0 ∨ m2 = ROOT_INO, links(m2, abs-dirs(fs, ri)) ≠ ∅ ∨ m2 = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), ⟨afs_drop_nlink#(mkdentry(str, m).ino; dirs, files); dent := negdentry(str); afs_inode_sync#(mkinode(m2, md, true, fs[ri[inodekey(m2)]].nlink, fs[ri[inodekey(m2)]].nsubdirs, fs[ri[inodekey(m2)]].size); dirs, files); afs_inode_sync#(mkinode(m, md0, true, 1, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size); dirs, files); p_inode := (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode(m2, files[m2].meta, false, files[m2].nlink, 0, files[m2].size) ); c_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m2, md, true, fs[ri[inodekey(m2)]].nlink, fs[ri[inodekey(m2)]].nsubdirs, fs[ri[inodekey(m2)]].size) = p_inode ∧ mkinode(m, md0, true, 1, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size) = c_inode ∧ mkdentry(str, m) = dent ∧ ENOSPC = err), fs[ri[inodekey(m2)]].nlink = 0 ∧ m2 ≠ ROOT_INO

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 409:
1 = fs[ri[inodekey(m)]].nlink, fs[ri[dentrykey(m2, str)]] = dentrynode(key, m), fs[ri[inodekey(m2)]] = inodenode(key0, md1, boolvar1, m3, m4, m5), abs-children(m, fs, ri) = ∅, boolvar1, dentrykeys(inodekey(m), ri) = ∅, dirs = abs-dirs(fs, ri)[m2, mkdir(m0, md1, m3, m1, abs-children(m2, fs, ri) -- str)], files = abs-files(fs, ri), links(m, fs, ri) = ∅ ++ dentrykey(m2, str), m4 = m1 + 1, m5 = m0 + 1, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m2)]].inode?, 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), ri[inodekey(m2)] ∈ fs, inodekey(m) ∈ ri, ri[dentrykey(m2, str)] ∈ fs, dentrykey(m2, str) ∈ ri, inodekey(m2) ∈ ri, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, links(m2, abs-dirs(fs, ri)) ≠ ∅ ∨ m2 = ROOT_INO, m3 ≠ 0 ∨ m2 = ROOT_INO ⊦ ⟨fail#(; ; err); asynced := ?⟩ ((asynced → boolvar) ∧ ENOSPC = err), ⟨afs_drop_nlink#(mkdentry(str, m).ino; dirs, files); dent := negdentry(str); afs_inode_sync#(mkinode(m2, md, true, m3, m4, m5); dirs, files); afs_inode_sync#(mkinode(m, md0, true, 1, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size); dirs, files); p_inode := (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode(m2, files[m2].meta, false, files[m2].nlink, 0, files[m2].size) ); c_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); err := ESUCCESS; asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m2, md, true, m3, m4, m5) = p_inode ∧ mkinode(m, md0, true, 1, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size) = c_inode ∧ mkdentry(str, m) = dent ∧ ENOSPC = err), m = 0, m = ROOT_INO, m2 = 0, m3 = 0 ∧ m2 ≠ ROOT_INO

Rule argument

spec: node name: elim-03 seq: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)) subst: [nd, key, md, boolvar, m, m0, m1] → [fs[ri[inodekey(m2)]], key0, md1, boolvar1, m3, m4, m5]

Additional information

Used simplifier rules: ⊦ nd.inode? → ( ( ( ( (key = nd.key ∧ md = nd.meta) ∧ (boolvar ↔ nd.directory)) ∧ m = nd.nlink) ∧ m0 = nd.nsubdirs) ∧ m1 = nd.size ↔ nd = inodenode(key, md, boolvar, m, m0, m1)); (elim) Used terms: fs[ri[inodekey(m2)]], key0, md1, boolvar1, m3, m4, m5