[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 44 from proof refine-rename-overwrite-keep-parent-different (previous step)

m11 + 1 = fs[ri[inodekey(m7)]].size, n0 + (boolvar1 ⊃ 1;0) = fs[ri[inodekey(m7)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), key = inodekey(fs[ri[dentrykey(m7, str0)]].ino), m = fs[ri[dentrykey(m7, str)]].ino, m3 = fs[ri[dentrykey(m7, str0)]].ino, m8 = fs[ri[inodekey(m7)]].nlink, new_dent = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m7, str)]].ino), ro = orphans(fs, ri), fs[ri[dentrykey(m7, str0)]].ino ≠ ROOT_INO, mkdentry(str, fs[ri[dentrykey(m7, str)]].ino) ≠ mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), fs[ri[inodekey(m7)]].directory, 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-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(fs[ri[dentrykey(m7, str)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, dentrykey(m7, str) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(m7) ∈ ri, m10 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar3 → boolvar0, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size, fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2 ⊦ [aubifs_core_journal_add4# (dentrynode(dentrykey(m7, old_dent.name), 0), dentrynode(dentrykey(m7, new_dent.name), old_dent.ino), inodenode(inodekey(m7), md1, true, m8, n0, m11), inodenode(key, md0, boolvar2, m10, m5, m6), ri, fi, orphans(fs, ri), fo ; adr2, adr1, adr0, adr, fs, log ; boolvar0, err); nd0 := inodenode(inodekey(m7), md1, true, m8, n0, m11); old_parent_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); new_child_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m7, old_dent.name), fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(dentrykey(m7, new_dent.name), adr1, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(inodekey(m7), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri); nd := inodenode(key, md0, boolvar2, m10, m5, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar0; ro); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode(old_parent_inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); new_child_inode := mkinode(new_child_inode.ino, 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? → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (boolvar3 → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 45:
n0 + (boolvar1 ⊃ 1;0) = fs[ri[inodekey(m7)]].nsubdirs, m11 + 1 = fs[ri[inodekey(m7)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory, adr5 = adr1, adr6 = adr2, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), key = inodekey(fs[ri[dentrykey(m7, str0)]].ino), m = fs[ri[dentrykey(m7, str)]].ino, m3 = fs[ri[dentrykey(m7, str0)]].ino, m8 = fs[ri[inodekey(m7)]].nlink, nd = inodenode(key, md0, boolvar2, m10, m5, m6), nd0 = inodenode(inodekey(m7), md1, true, m8, n0, m11), nd1 = dentrynode(dentrykey(m7, new_dent.name), old_dent.ino), nd2 = dentrynode(dentrykey(m7, old_dent.name), 0), new_dent = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m7, str)]].ino), ro = orphans(fs, ri), ro0 = orphans(fs, ri), old_dent.dentry?, fs[ri[inodekey(m7)]].directory, 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-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m7) ∈ ri, dentrykey(m7, str0) ∈ ri, dentrykey(m7, str) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, inodekey(fs[ri[dentrykey(m7, str)]].ino) ∈ ri, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory → abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, boolvar3 → boolvar0, m10 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory ∧ boolvar2 ∧ m10 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m7, str)]].ino)]].size, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO ⊦ [if ri-cons(ri, fs) ∧ node-cons(nd2.key, nd2) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3, adr4 with new(adr1 ' + adr2 ' + (adr3 ' + adr4), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ') in {adr6 := adr1, adr5 := adr2, adr0 := adr3, adr := adr4; fs := fs[adr6, nd2][adr5, nd1][adr0, nd0][adr, nd], log := (((log + adr6) + adr5) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr6 := ?, adr5 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; nd0 := inodenode(inodekey(m7), md1, true, m8, n0, m11); old_parent_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); new_child_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); boolvar0 := boolvar, adr1 := adr5; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m7, old_dent.name), fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(dentrykey(m7, new_dent.name), adr1, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(inodekey(m7), adr0, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key, adr, fi, ro0, fo, fs, log, boolvar0; ri); nd := inodenode(key, md0, boolvar2, m10, m5, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar0; ro0); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode(old_parent_inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.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? → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar3 → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, mkdentry(str, fs[ri[dentrykey(m7, str)]].ino) = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_journal_add4# (ND1, ND2, ND3, ND4, RI, FI, RO, FO ; ADR1, ADR2, ADR3, ADR4, FS, LOG ; CSYNCED, ERR ) {if ri-cons(RI, FS) ∧ node-cons(ND1.key, ND1) ∧ node-cons(ND2.key, ND2) ∧ node-cons(ND3.key, ND3) ∧ node-cons(ND4.key, ND4) then { choose adr1, adr2, adr3, adr4 with new(adr1 ' + adr2 ' + (adr3 ' + adr4), FS) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ') in {ADR1 := adr1, ADR2 := adr2, ADR3 := adr3, ADR4 := adr4; FS := FS[ADR1, ND1][ADR2, ND2][ADR3, ND3][ADR4, ND4], LOG := (((LOG + ADR1) + ADR2) + ADR3) + ADR4, ERR := ESUCCESS} ifnone ERR := ENOSPC or {fail#(; ; ERR); ADR1 := ?, ADR2 := ?, ADR3 := ?, ADR4 := ?}; CSYNCED := ?} else abort };