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

m14 + 1 = fs0[ri[inodekey(m9)]].size, m12 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m4, str0)]].ino)]].nlink, 0 = fs0[ri[inodekey(fs0[ri[dentrykey(m9, str)]].ino)]].nsubdirs, 0 = fs0[ri[inodekey(fs0[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, dentrynode(dentrykey(m9, str), 0)][adr2, dentrynode(dentrykey(m4, str0), fs0[ri[dentrykey(m9, str)]].ino)] [adr3, inodenode(inodekey(m9), md2, true, fs0[ri[inodekey(m9)]].nlink, fs0[ri[inodekey(m9)]].nsubdirs, m14) ] [adr4, inodenode(inodekey(m4), md1, true, fs0[ri[inodekey(m4)]].nlink, fs0[ri[inodekey(m4)]].nsubdirs, fs0[ri[inodekey(m4)]].size) ] [adr5, inodenode(inodekey(fs0[ri[dentrykey(m4, str0)]].ino), md0, false, m12, 0, m5) ], m = fs0[ri[dentrykey(m9, str)]].ino, m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m9, str)]].ino)]].nlink, m1 = fs0[ri[dentrykey(m4, str0)]].ino, m10 = fs0[ri[inodekey(m9)]].nlink, m6 = fs0[ri[inodekey(m4)]].nlink, m7 = fs0[ri[inodekey(m4)]].nsubdirs, m8 = fs0[ri[inodekey(m4)]].size, n0 = fs0[ri[inodekey(m9)]].nsubdirs, new_dent = mkdentry(str0, fs0[ri[dentrykey(m4, str0)]].ino), old_dent = mkdentry(str, fs0[ri[dentrykey(m9, str)]].ino), ro = orphans(fs0, ri), fs0[ri[dentrykey(m4, str0)]].ino ≠ ROOT_INO, fs0[ri[dentrykey(m4, str0)]].ino ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr1 ≠ adr4, adr1 ≠ adr5, adr2 ≠ adr3, adr2 ≠ adr4, adr2 ≠ adr5, adr3 ≠ adr4, adr3 ≠ adr5, adr4 ≠ adr5, m4 ≠ 0, m9 ≠ m4, m9 ≠ 0, fs0[ri[inodekey(m4)]].directory, fs0[ri[inodekey(m9)]].directory, orphans(fs0, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m9) ∈ ri, inodekey(m4) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(fs0[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m9, str) ∈ ri, inodekey(fs0[ri[dentrykey(m9, str)]].ino) ∈ ri, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m4, str0)]].ino)]].directory, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m9, str)]].ino)]].directory, ¬ adr5 ∈ fs0, ¬ adr4 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, boolvar2 → boolvar0, m12 = 0 → links(fs0[ri[dentrykey(m4, str0)]].ino, fs0, ri) = ∅ ++ dentrykey(m4, str0), fs0[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, fs0[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs0, ri)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs0, ri)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ [aubifs_core_index_remove# (dentrykey(m9, old_dent.name), fi, orphans(fs0, ri), fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar1; ri); aubifs_core_index_store# (dentrykey(m4, new_dent.name), adr2, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar1; ri); aubifs_core_index_store#(inodekey(m9), adr3, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar1; ri); aubifs_core_index_store#(inodekey(m4), adr4, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar1; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr5, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar1; ri); nd := inodenode(inodekey(new_dent.ino), md0, false, m12, 0, m5); log := ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '; if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar1; ro); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode (m9, inodenode(inodekey(m9), md2, true, m10, n0, m14).meta, inodenode(inodekey(m9), md2, true, m10, n0, m14).directory, inodenode(inodekey(m9), md2, true, m10, n0, m14).nlink, inodenode(inodekey(m9), md2, true, m10, n0, m14).nsubdirs, inodenode(inodekey(m9), md2, true, m10, n0, m14).size); new_child_inode := mkinode(m1, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)] ( ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro.inodes? → ⟨old_dent_inode0 := mkinode(m, md, false, m0, 0, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m1); old_dent_inode := mkinode(m, md, false, m0, 0, m2); new_dent_inode := mkinode(m1, md0, false, m12 + 1, 0, m5); new_inode := mkinode(m4, md1, true, m6, m7, m8); old_inode := mkinode(m9, md2, true, m10, n0, m14 + 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(ro) ∧ (boolvar2 → boolvar1) ∧ old_parent_inode = old_inode ∧ mkinode(m4, md1, true, m6, m7, m8) = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ ESUCCESS = err0)), fs0[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO, fs0[ri[inodekey(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_remove#(KEY, FI, RO, FO, FS, LOG, CSYNCED; RI) {RI := RI -- KEY};