[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 54 from proof refine-rename-overwrite-reparent-dir (previous step)

m16 + 1 = fs0[ri[inodekey(m11)]].nsubdirs, m13 + 1 = fs0[ri[inodekey(m11)]].size, m14 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m7, str0)]].ino)]].nlink, abs-children(fs0[ri[dentrykey(m7, str0)]].ino, fs0, ri) = ∅, adr6 = adr9, adr7 = adr10, adr8 = adr11, dentrykeys(inodekey(fs0[ri[dentrykey(m7, str0)]].ino), ri) = ∅, dirs = abs-dirs(fs0, ri), err = ESUCCESS, files = abs-files(fs0, ri), fs = fs0[adr1, nd3][adr2, nd2][adr3, nd1][adr4, nd0][adr5, nd], log = ((((log0 + adr1) + adr2) + adr3) + adr4) + adr5, m = fs0[ri[dentrykey(m11, str)]].ino, m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m11, str)]].ino)]].nlink, m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m11, str)]].ino)]].nsubdirs, m10 = fs0[ri[inodekey(m7)]].size, m12 = fs0[ri[inodekey(m11)]].nlink, m2 = fs0[ri[inodekey(fs0[ri[dentrykey(m11, str)]].ino)]].size, m3 = fs0[ri[dentrykey(m7, str0)]].ino, m5 = fs0[ri[inodekey(fs0[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, m6 = fs0[ri[inodekey(fs0[ri[dentrykey(m7, str0)]].ino)]].size, m8 = fs0[ri[inodekey(m7)]].nlink, m9 = fs0[ri[inodekey(m7)]].nsubdirs, nd = inodenode(inodekey(new_dent.ino), md0, true, m14, m5, m6), nd0 = inodenode(inodekey(m7), md1, true, m8, m9, m10), nd1 = inodenode(inodekey(m11), md2, true, m12, m16, m13), nd2 = dentrynode(dentrykey(m7, new_dent.name), old_dent.ino), nd3 = dentrynode(dentrykey(m11, old_dent.name), 0), new_dent = mkdentry(str0, fs0[ri[dentrykey(m7, str0)]].ino), old_dent = mkdentry(str, fs0[ri[dentrykey(m11, str)]].ino), ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), new_dent.dentry?, old_dent.dentry?, fs0[ri[inodekey(m11)]].directory, fs0[ri[inodekey(fs0[ri[dentrykey(m7, str0)]].ino)]].directory, fs0[ri[inodekey(m7)]].directory, fs0[ri[inodekey(fs0[ri[dentrykey(m11, str)]].ino)]].directory, fo.inodes?, orphans(fs0, ri).inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), new(adr1 ' + adr2 ' + adr3 ' + (adr4 ' + adr5), fs0), node-cons(nd3.key, nd3), node-cons(nd2.key, nd2), node-cons(nd1.key, nd1), node-cons(nd0.key, nd0), node-cons(nd.key, nd), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(fs0[ri[dentrykey(m11, str)]].ino) ∈ ri, dentrykey(m11, str) ∈ ri, inodekey(fs0[ri[dentrykey(m7, str0)]].ino) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(m7) ∈ ri, inodekey(m11) ∈ ri, boolvar2 → boolvar1, m14 = 0 → links(fs0[ri[dentrykey(m7, str0)]].ino, fs0, ri) = ∅ ++ dentrykey(m7, str0), fs0[ri[inodekey(m11)]].nlink ≠ 0 ∨ m11 = ROOT_INO, fs0[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs0, ri)) ≠ ∅ ∨ m11 = ROOT_INO, links(m7, abs-dirs(fs0, ri)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ [m15 := m7; old_parent_inode := mkinode(m11, md2, true, m12, m16 + 1, m13 + 1); new_child_inode := mkinode(m3, md0, true, m14 + 1, m5, m6); boolvar1 := boolvar, adr9 := adr3, adr10 := adr2; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m11, old_dent.name), fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(dentrykey(m15, new_dent.name), adr10, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m11), adr9, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m15), adr4, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr5, fi, ro0, fo, fs, log, boolvar1; ri); nd := inodenode(inodekey(new_dent.ino), md0, true, m14, m5, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar1; ro0); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode (old_parent_inode.ino, inodenode(inodekey(m11), md2, true, m12, m16, m13).meta, inodenode(inodekey(m11), md2, true, m12, m16, m13).directory, inodenode(inodekey(m11), md2, true, m12, m16, m13).nlink, inodenode(inodekey(m11), md2, true, m12, m16, m13).nsubdirs, inodenode(inodekey(m11), md2, true, m12, m16, m13).size); new_child_inode := mkinode(new_child_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟨old_dent_inode0 := mkinode(m, md, true, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_dent_inode := mkinode(m, md, true, m0, m1, m2); new_dent_inode := mkinode(m3, md0, true, m14 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m8, m9, m10); old_inode := mkinode(m11, md2, true, m12, m16 + 1, m13 + 1); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar2)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar2 → boolvar1) ∧ old_parent_inode = old_inode ∧ mkinode(m15, md1, true, m8, m9, m10) = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs0[ri[dentrykey(m7, str0)]].ino = ROOT_INO, m11 = m7, dups(adr1 ' + adr2 ' + adr3 ' + adr4 ' + adr5 '), fs0[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO, fs0[ri[inodekey(m11)]].nlink = 0 ∧ m11 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information