[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-reparent (previous step)

dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), m = fs[ri[dentrykey(m3, str)]].ino, m10 = fs[ri[inodekey(m7)]].size, m4 = fs[ri[inodekey(m3)]].nlink, m5 = fs[ri[inodekey(m3)]].nsubdirs, m6 = fs[ri[inodekey(m3)]].size, m8 = fs[ri[inodekey(m7)]].nlink, m9 = fs[ri[inodekey(m7)]].nsubdirs, new_dent = negdentry(str0), new_parent_inode = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size), 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, m3 ≠ m7, fs[ri[inodekey(m7)]].directory, 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), inodekey(m7) ∈ ri, dentrykey(m3, str) ∈ ri, inodekey(fs[ri[dentrykey(m3, str)]].ino) ∈ ri, inodekey(m3) ∈ ri, 1 ≤ fs[ri[inodekey(m3)]].size, ¬ dentrykey(m7, 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(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO ⊦ [aubifs_rename_new_reparent# (boolvar1, mkinode(m, md, boolvar1, m0, m1, m2), fi, orphans(fs, ri), fo ; old_parent_inode, new_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) → ⟨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_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); old_inode := mkinode(m3, md0, true, m4, m5, m6); new_inode := mkinode(m7, md1, true, m8, m9, m10); 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, fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ 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_rename_new_reparent# (IS_DIR, OLD_CHILD_INODE, FI, RO, FO ; OLD_PARENT_INODE, NEW_PARENT_INODE, OLD_DENT, NEW_DENT, ERR, RI, FS, LOG, CSYNCED ) {if pre-rename-new-reparent (OLD_PARENT_INODE, OLD_DENT, OLD_CHILD_INODE, NEW_PARENT_INODE, NEW_DENT, FS, RI, RO) ∧ (IS_DIR ↔ OLD_CHILD_INODE.directory) then choose KEY1, KEY2, KEY3, KEY4, ND1, ND2, ND3, ND4, ADR1, ADR2, ADR3, ADR4 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 + (IS_DIR ⊃ 1;0), NEW_PARENT_INODE.size + 1); aubifs_core_journal_add4# (ND1, ND2, ND3, ND4, RI, FI, RO, FO ; ADR1, ADR2, ADR3, ADR4, 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); 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_PARENT_INODE := mkinode (NEW_PARENT_INODE.ino, ND4.meta, ND4.directory, ND4.nlink, ND4.nsubdirs, ND4.size)}} else abort };