[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 156 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) = ∅, links(m2, fs0, ri0) = ∅ ++ dentrykey(m, str), p_ino = m, 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, abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino].size ≥ 1, asynced → boolvar0, links(m, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m = ROOT_INO, m3 ≠ 0 ∨ m = ROOT_INO ⊦ ⟨dirs := abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)] [p_ino, abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino] .size:= (abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino].size - 1) ] [p_ino, abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)] [p_ino, abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino] .size:= (abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino].size - 1) ] [p_ino ] .nsubdirs:= ( abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)] [p_ino, abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino] .size:= ( abs-dirs(fs0, ri0)[p_ino, abs-dirs(fs0, ri0)[p_ino].entries:= (abs-dirs(fs0, ri0)[p_ino].entries -- str)][p_ino] .size - 1) ] [p_ino ] .nsubdirs - 1) ]; let ino = mkdentry(str, m2).ino in {files := abs-files(fs0, ri0); afs_drop_nlink#(ino; dirs, files)}; dent := negdentry(str); afs_inode_sync#(mkinode(m, md, true, m3, m0 + 1, m1 + 1); dirs, files); afs_inode_sync#(mkinode(m2, md0, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size); dirs, files); p_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) ); c_inode := getinode(mkinode(m2, md0, true, 1, fs0[ri0[inodekey(m2)]].nsubdirs, fs0[ri0[inodekey(m2)]].size).ino, dirs, files); err := ESUCCESS; 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_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

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information