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

0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, 0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nsubdirs, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m9, str)]].ino, m0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nlink, m1 = fs[ri[dentrykey(m4, str0)]].ino, m10 = fs[ri[inodekey(m9)]].nlink, m11 = fs[ri[inodekey(m9)]].nsubdirs, m12 = fs[ri[inodekey(m9)]].size, m3 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, m6 = fs[ri[inodekey(m4)]].nlink, m7 = fs[ri[inodekey(m4)]].nsubdirs, m8 = fs[ri[inodekey(m4)]].size, new_child_inode = mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, 0, m5), new_dent = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), new_parent_inode = mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), old_parent_inode = mkinode(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, fs[ri[inodekey(m9)]].size), ro = orphans(fs, ri), fs[ri[dentrykey(m4, str0)]].ino ≠ ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink ≠ 0, fs[ri[inodekey(m9)]].size ≠ 0, m9 ≠ m4, fs[ri[inodekey(m9)]].directory, fs[ri[inodekey(m4)]].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(m9, str)]].ino) ∈ ri, dentrykey(m9, str) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(m4) ∈ ri, inodekey(m9) ∈ ri, 1 ≤ fs[ri[inodekey(m9)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].directory, ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory, boolvar → boolvar0, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, fs[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO ⊦ [aubifs_rename_overwrite_reparent# (false, mkinode(m, md, false, m0, 0, m2), fi, fo ; old_parent_inode, new_parent_inode, new_child_inode, old_dent, new_dent, err, ri, ro, fs, log, boolvar0)] ( 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, m3, 0, m5); new_inode := mkinode(m4, md1, true, m6, m7, m8); old_inode := mkinode(m9, md2, true, m10, m11, m12); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (boolvar → 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(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO, fs[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 21:
boolvar0 ↔ false, boolvar ↔ boolvar1, 0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nsubdirs, 0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m9, str)]].ino, m0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nlink, m1 = fs[ri[dentrykey(m4, str0)]].ino, m10 = fs[ri[inodekey(m9)]].nlink, m11 = fs[ri[inodekey(m9)]].nsubdirs, m12 = fs[ri[inodekey(m9)]].size, m3 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, m6 = fs[ri[inodekey(m4)]].nlink, m7 = fs[ri[inodekey(m4)]].nsubdirs, m8 = fs[ri[inodekey(m4)]].size, new_child_inode = mkinode(fs[ri[dentrykey(m4, str0)]].ino, md0, false, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, 0, m5), new_dent = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), new_parent_inode = mkinode(m4, md1, true, fs[ri[inodekey(m4)]].nlink, fs[ri[inodekey(m4)]].nsubdirs, fs[ri[inodekey(m4)]].size), old_child_inode = mkinode(m, md, false, m0, 0, m2), old_dent = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), old_parent_inode = mkinode(m9, md2, true, fs[ri[inodekey(m9)]].nlink, fs[ri[inodekey(m9)]].nsubdirs, fs[ri[inodekey(m9)]].size), ro = orphans(fs, ri), fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m9)]].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(m9) ∈ ri, inodekey(m4) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m9, str) ∈ ri, inodekey(fs[ri[dentrykey(m9, str)]].ino) ∈ ri, 1 ≤ fs[ri[inodekey(m9)]].size, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), boolvar2 → boolvar1, fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, fs[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ [if pre-rename-overwrite-reparent(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, fs, ri, ro) ∧ (boolvar0 ↔ old_child_inode.directory) then choose key3, key2, key1, key0, key, nd3, nd2, nd1, nd0, nd, adr3, adr2, adr1, adr0, adr with true in {key3 := dentrykey(old_parent_inode.ino, old_dent.name); nd3 := dentrynode(key3, 0); key2 := dentrykey(new_parent_inode.ino, new_dent.name); nd2 := dentrynode(key2, old_dent.ino); key1 := inodekey(old_parent_inode.ino); nd1 := inodenode (key1, old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - (boolvar0 ⊃ 1;0), old_parent_inode.size - 1); key0 := inodekey(new_parent_inode.ino); nd0 := inodenode (key0, new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs, new_parent_inode.size); key := inodekey(new_dent.ino); nd := inodenode (key, new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink - 1, new_child_inode.nsubdirs, new_child_inode.size); aubifs_core_journal_add5#(nd3, nd2, nd1, nd0, nd, ri, fi, ro, fo; adr3, adr2, adr1, adr0, adr, fs, log; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(key3, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key2, adr2, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key1, adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode(old_parent_inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); new_child_inode := mkinode(new_child_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}} else abort] ( 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, m3, 0, m5); new_inode := mkinode(m4, md1, true, m6, m7, m8); old_inode := mkinode(m9, md2, true, m10, m11, m12); 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 → boolvar) ∧ 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(m4, str0)]].ino = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink = 0, fs[ri[inodekey(m9)]].size = 0, m9 = m4, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory, fs[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO, fs[ri[inodekey(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_rename_overwrite_reparent# (IS_DIR, OLD_CHILD_INODE, FI, FO ; OLD_PARENT_INODE, NEW_PARENT_INODE, NEW_CHILD_INODE, OLD_DENT, NEW_DENT, ERR, RI, RO, FS, LOG, CSYNCED ) {if pre-rename-overwrite-reparent (OLD_PARENT_INODE, OLD_DENT, OLD_CHILD_INODE, NEW_PARENT_INODE, NEW_DENT, NEW_CHILD_INODE, FS, RI, RO) ∧ (IS_DIR ↔ OLD_CHILD_INODE.directory) then choose KEY1, KEY2, KEY3, KEY4, KEY5, ND1, ND2, ND3, ND4, ND5, ADR1, ADR2, ADR3, ADR4, ADR5 with true in {KEY1 := dentrykey(OLD_PARENT_INODE.ino, OLD_DENT.name); ND1 := dentrynode(KEY1, 0); KEY2 := dentrykey(NEW_PARENT_INODE.ino, NEW_DENT.name); ND2 := dentrynode(KEY2, OLD_DENT.ino); KEY3 := inodekey(OLD_PARENT_INODE.ino); ND3 := inodenode (KEY3, OLD_PARENT_INODE.meta, OLD_PARENT_INODE.directory, OLD_PARENT_INODE.nlink, OLD_PARENT_INODE.nsubdirs - (IS_DIR ⊃ 1;0), OLD_PARENT_INODE.size - 1); KEY4 := inodekey(NEW_PARENT_INODE.ino); ND4 := inodenode (KEY4, NEW_PARENT_INODE.meta, NEW_PARENT_INODE.directory, NEW_PARENT_INODE.nlink, NEW_PARENT_INODE.nsubdirs, NEW_PARENT_INODE.size); KEY5 := inodekey(NEW_DENT.ino); ND5 := inodenode (KEY5, NEW_CHILD_INODE.meta, NEW_CHILD_INODE.directory, NEW_CHILD_INODE.nlink - 1, NEW_CHILD_INODE.nsubdirs, NEW_CHILD_INODE.size); aubifs_core_journal_add5# (ND1, ND2, ND3, ND4, ND5, RI, FI, RO, FO ; ADR1, ADR2, ADR3, ADR4, ADR5, FS, LOG ; CSYNCED, ERR); if ERR = ESUCCESS then {aubifs_core_index_remove# (KEY1, FI, RO, FO, FS, LOG, CSYNCED; RI); aubifs_core_index_store# (KEY2, ADR2, FI, RO, FO, FS, LOG, CSYNCED; RI); aubifs_core_index_store# (KEY3, ADR3, FI, RO, FO, FS, LOG, CSYNCED; RI); aubifs_core_index_store# (KEY4, ADR4, FI, RO, FO, FS, LOG, CSYNCED; RI); aubifs_core_index_store# (KEY5, ADR5, FI, RO, FO, FS, LOG, CSYNCED; RI); if ND5.nlink = 0 then aubifs_core_orphans_insert# (KEY5, RI, FI, FO, FS, LOG, CSYNCED; RO); NEW_DENT := mkdentry(NEW_DENT.name, OLD_DENT.ino); OLD_DENT := negdentry(OLD_DENT.name); OLD_PARENT_INODE := mkinode (OLD_PARENT_INODE.ino, ND3.meta, ND3.directory, ND3.nlink, ND3.nsubdirs, ND3.size); NEW_CHILD_INODE := mkinode (NEW_CHILD_INODE.ino, ND5.meta, ND5.directory, ND5.nlink, ND5.nsubdirs, ND5.size)}} else abort };