[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 18 from proof refine-rename-new-keep-parent (previous step)

dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m3, str)]].ino, m4 = fs[ri[inodekey(m3)]].nlink, m5 = fs[ri[inodekey(m3)]].nsubdirs, m6 = fs[ri[inodekey(m3)]].size, new_dent = negdentry(str0), old_dent = mkdentry(str, fs[ri[dentrykey(m3, str)]].ino), old_parent_inode = mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size), ro = orphans(fs, ri), fs[ri[inodekey(m3)]].size ≠ 0, fs[ri[inodekey(m3)]].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), dentrykey(m3, str) ∈ ri, inodekey(fs[ri[dentrykey(m3, str)]].ino) ∈ ri, inodekey(m3) ∈ ri, 1 ≤ fs[ri[inodekey(m3)]].size, ¬ dentrykey(m3, str0) ∈ ri, boolvar → boolvar0, boolvar1 → 1 ≤ fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, ¬ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].size, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO ⊦ [aubifs_rename_new_keep_parent# (boolvar1, mkinode(m, md, boolvar1, m0, m1, m2), fi, orphans(fs, ri), fo; old_parent_inode, old_dent, new_dent, err, ri, 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) → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode0 := new_dent_inode; old_dent0 := mkdentry(str, m); old_dent1 := negdentry(str0); old_inode := mkinode(m3, md0, true, m4, m5, m6); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_inode := mkinode(m3, md0, true, m4, m5, m6); 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_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[inodekey(m3)]].nlink = 0 ∧ m3 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 19:
boolvar0 ↔ boolvar1, boolvar ↔ boolvar2, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m3, str)]].ino, m4 = fs[ri[inodekey(m3)]].nlink, m5 = fs[ri[inodekey(m3)]].nsubdirs, m6 = fs[ri[inodekey(m3)]].size, new_dent = negdentry(str0), old_child_inode = mkinode(m, md, boolvar1, m0, m1, m2), old_dent = mkdentry(str, fs[ri[dentrykey(m3, str)]].ino), old_parent_inode = mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size), parent_inode = old_parent_inode, ro = orphans(fs, ri), ro0 = orphans(fs, ri), fs[ri[inodekey(m3)]].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(m3) ∈ ri, inodekey(fs[ri[dentrykey(m3, str)]].ino) ∈ ri, dentrykey(m3, str) ∈ ri, 1 ≤ fs[ri[inodekey(m3)]].size, boolvar1 → 1 ≤ fs[ri[inodekey(m3)]].nsubdirs, boolvar3 → boolvar2, fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].size, fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ [if pre-rename-new-keep-parent(parent_inode, old_dent, old_child_inode, new_dent, fs, ri, ro) ∧ (boolvar0 ↔ old_child_inode.directory) then choose key1, key0, key, nd1, nd0, nd, adr1, adr0, adr with true in {key1 := dentrykey(parent_inode.ino, old_dent.name); nd1 := dentrynode(key1, 0); key0 := dentrykey(parent_inode.ino, new_dent.name); nd0 := dentrynode(key0, old_dent.ino); key := inodekey(parent_inode.ino); nd := inodenode(key, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size); aubifs_core_journal_add3#(nd1, nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(key1, 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); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); parent_inode := mkinode(parent_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}} else abort] ( 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) → ⟪new_parent_inode := parent_inode⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode0 := new_dent_inode; old_dent0 := mkdentry(str, m); old_dent1 := negdentry(str0); old_inode := mkinode(m3, md0, true, m4, m5, m6); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_inode := mkinode(m3, md0, true, m4, m5, m6); 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 → boolvar) ∧ parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[inodekey(m3)]].size = 0, dentrykey(m3, str0) ∈ ri, fs[ri[inodekey(m3)]].nlink = 0 ∧ m3 ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_rename_new_keep_parent# (IS_DIR, OLD_CHILD_INODE, FI, RO, FO ; PARENT_INODE, OLD_DENT, NEW_DENT, ERR, RI, FS, LOG, CSYNCED ) {if pre-rename-new-keep-parent (PARENT_INODE, OLD_DENT, OLD_CHILD_INODE, NEW_DENT, FS, RI, RO) ∧ (IS_DIR ↔ OLD_CHILD_INODE.directory) then choose KEY1, KEY2, KEY3, ND1, ND2, ND3, ADR1, ADR2, ADR3 with true in {KEY1 := dentrykey(PARENT_INODE.ino, OLD_DENT.name); ND1 := dentrynode(KEY1, 0); KEY2 := dentrykey(PARENT_INODE.ino, NEW_DENT.name); ND2 := dentrynode(KEY2, OLD_DENT.ino); KEY3 := inodekey(PARENT_INODE.ino); ND3 := inodenode (KEY3, PARENT_INODE.meta, PARENT_INODE.directory, PARENT_INODE.nlink, PARENT_INODE.nsubdirs, PARENT_INODE.size); aubifs_core_journal_add3# (ND1, ND2, ND3, RI, FI, RO, FO ; ADR1, ADR2, ADR3, 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); NEW_DENT := mkdentry(NEW_DENT.name, OLD_DENT.ino); OLD_DENT := negdentry(OLD_DENT.name); PARENT_INODE := mkinode (PARENT_INODE.ino, ND3.meta, ND3.directory, ND3.nlink, ND3.nsubdirs, ND3.size)}} else abort };