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

0 = fs0[ri0[inodekey(m1)]].nsubdirs, 1 = fs0[ri0[inodekey(m1)]].nlink, fs0[ri0[inodekey(m)]] = inodenode(key0, md1, true, m2, m3, m0 + 1), fs0[ri0[dentrykey(m, str)]] = dentrynode(key, m1), dirs = abs-dirs(fs0, ri0)[m, mkdir(m0, md, m2, m3, abs-children(m, fs0, ri0) -- str)], files = abs-files(fs0, ri0)[m1, mkfile(fs0[ri0[inodekey(m1)]].size, fs0[ri0[inodekey(m1)]].meta, 0, abs-content(m1, fs0, ri0))], ino = inode.ino, inode = mkinode(m1, md0, false, 1, 0, m6), links(m1, fs0, ri0) = ∅ ++ dentrykey(m, str), 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, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6)]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0) ++ inodekey(m1)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0) ++ inodekey(m1), 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(m1), adr3]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)][adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6)], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3], orphans(fs0, ri0) ++ inodekey(m1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ino ∈ dirs, inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, inodekey(m1) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, dentrykey(m, str) ∈ ri0, asynced → boolvar0, m2 ≠ 0 ∨ m = ROOT_INO, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨asynced := ?⟩ ( afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → dirs[ino, dirs[ino].meta:= inode.meta] = abs-dirs (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]) ∧ files = abs-files (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]) ∧ orphans (fs0[adr1, inodenode(inodekey(m), md, true, m2, m3, m0)][adr2, dentrynode(dentrykey(m, str), 0)] [adr3, inodenode(inodekey(m1), md0, false, 0, 0, m6) ], (ri0[inodekey(m), adr1] -- dentrykey(m, str))[inodekey(m1), adr3]) = orphans(fs0, ri0) ++ inodekey(m1) ∧ (asynced → boolvar) ∧ mkinode(m, md, true, m2, m3, m0) = (m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) ∧ mkinode(m1, md0, false, 0, 0, m6) = (m1 ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m1, dirs[ino, dirs[ino].meta:= inode.meta][m1].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m1].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m1].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m1].size) ;mkinode(m1, files[m1].meta, false, files[m1].nlink, 0, files[m1].size) ) ∧ ESUCCESS = ESUCCESS), adr1 = adr3, adr1 = adr2, adr2 = adr3, m = 0, m1 = 0, m1 = ROOT_INO, fs0[ri0[inodekey(m1)]].directory, ino ∈ files, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)