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

new_dent = negdentry(str0), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[inodekey(m)]].size ≠ 0, fs[ri[inodekey(m)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, inodekey(m) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, ¬ inodekey(m) ∈ ro, ¬ dentrykey(m, str0) ∈ ri, boolvar → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size ⊦ ⟪aubifs_rename_new_keep_parent# (boolvar, mkinode(fs[ri[dentrykey(m, str)]].ino, md0, boolvar, m1, m2, m3), fi, ro, fo ; 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))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 12:
boolvar0 ↔ boolvar2, boolvar ↔ boolvar1, new_dent = negdentry(str0), old_child_inode = mkinode(fs[ri[dentrykey(m, str)]].ino, md0, boolvar2, m1, m2, m3), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar2 ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪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, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[inodekey(m)]].size = 0, inodekey(m) ∈ ro, dentrykey(m, str0) ∈ ri

Rule argument

pos: right 1

Additional information

Used simplifier rules: rename-new-keep-parent: ⊦ ;%dentry-ubifs-cons: ⊦ dentrykey(ino, str) ∈ ri ∧ ri[dentrykey(ino, str)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[dentrykey(ino, str)]].dentry?;% ⊦ key ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ri[key] ∈ fs; (ss)