[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 15 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)⟫ ⟨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

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: aubifs-asm name: inv-rename-new-reparent seq: 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), ri-inj(fi), log-cons(log, fs), ro.inodes?, fo.inodes?, pre-rename-new-reparent (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, fs, ri, ro), boolvar ↔ old_child_inode.directory ⊦ ⟪aubifs_rename_new_reparent# (boolvar, old_child_inode, fi, ro, 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)) subst: [fo, ro, fi, old_child_inode, boolvar, boolvar0, log, fs, ri, err, new_dent, old_dent, new_parent_inode, old_parent_inode] → [fo, orphans(fs, ri), fi, mkinode(m, md, boolvar1, m0, m1, m2), boolvar1, boolvar0, log, fs, ri, err, new_dent, old_dent, new_parent_inode, old_parent_inode] flags: List([[1,0,0]])

Additional information

Used simplifier rules: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-inj(ri); (ss)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → log-cons(log, fs); (ss)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ro.inodes?; (ss)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → fo.inodes?; (ss)%⊦ pre-rename-new-reparent (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, fs, ri, ro) ↔ ( valid-negdentry(new_parent_inode.ino, new_dent, fs, ri, ro) ∧ valid-dentry(old_parent_inode.ino, old_dent, fs, ri, ro) ∧ valid-dir-inode(new_parent_inode, fs, ri) ∧ valid-dir-inode(old_parent_inode, fs, ri) ∧ new_parent_inode.ino ≠ old_parent_inode.ino ∧ valid-wb-inode(old_child_inode, fs, ri) ∧ old_child_inode.ino = old_dent.ino) ∧ old_parent_inode.size ≥ 1 ∧ (old_child_inode.directory → old_parent_inode.nsubdirs ≥ 1); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)%⊦ valid-negdentry(ino, dent, fs, ri, ro) ↔ dent.negdentry? ∧ valid-parent-ino(ino, fs, ri, ro) ∧ ¬ dentrykey(ino, dent.name) ∈ ri; (s)% ⊦ negdentry(str).negdentry?; (s)%⊦ valid-parent-ino(ino, fs, ri, ro) ↔ ( valid-dir-ino(ino, fs, ri) ∧ (fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO)) ∧ ¬ inodekey(ino) ∈ ro; (s)%⊦ valid-dir-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ key ∈ orphans(fs, ri) ↔ key.inode? ∧ key ∈ ri ∧ fs[ri[key]].nlink = 0 ∧ key.ino ≠ ROOT_INO; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ negdentry(str).name = str; (s)%⊦ valid-dentry(ino, dent, fs, ri, ro) ↔ dent.dentry? ∧ valid-parent-ino(ino, fs, ri, ro) ∧ valid-ino(dent.ino, fs, ri) ∧ dentrykey(ino, dent.name) ∈ ri ∧ fs[ri[dentrykey(ino, dent.name)]].ino = dent.ino; (s)% ⊦ mkdentry(str, m).dentry?; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ valid-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri; (s)% ⊦ mkdentry(str, m).name = str; (s)%⊦ valid-dir-inode(inode, fs, ri) ↔ valid-dir-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs ∧ inode.size = fs[ri[inodekey(inode.ino)]].size; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)%⊦ valid-wb-inode(inode, fs, ri) ↔ valid-file-inode(inode, fs, ri) ∨ valid-dir-inode(inode, fs, ri); (s)%⊦ valid-file-inode(inode, fs, ri) ↔ valid-file-ino(inode.ino, fs, ri) ∧ (inode.directory ↔ fs[ri[inodekey(inode.ino)]].directory) ∧ inode.nlink = fs[ri[inodekey(inode.ino)]].nlink ∧ inode.nsubdirs = fs[ri[inodekey(inode.ino)]].nsubdirs; (s)%⊦ valid-file-ino(ino, fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)