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

fs[ri[dentrykey(m, str)]] = dentrynode(key, m0), adr4 = adr1, m4 = fs[ri[inodekey(m)]].nlink, m5 = fs[ri[inodekey(m)]].nsubdirs, m6 = fs[ri[inodekey(m)]].size, nd = inodenode(inodekey(m), md, true, m4, m5, m6), nd0 = dentrynode(dentrykey(m, str0), mkdentry(str, m0).ino), nd1 = dentrynode(dentrykey(m, str), 0), mkdentry(str, m0).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(m0) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∨ fs[ri[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∧ m3 = fs[ri[inodekey(m0)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m0).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).size)}⟫ (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, dentrykey(m, str0) ∈ ri, inodekey(m) ∈ ro

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 27:
fs[ri[dentrykey(m, str)]] = dentrynode(key, m0), adr4 = adr1, m4 = fs[ri[inodekey(m)]].nlink, m5 = fs[ri[inodekey(m)]].nsubdirs, m6 = fs[ri[inodekey(m)]].size, nd = inodenode(inodekey(m), md, true, m4, m5, m6), nd0 = dentrynode(dentrykey(m, str0), mkdentry(str, m0).ino), nd1 = dentrynode(dentrykey(m, str), 0), mkdentry(str, m0).dentry?, 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(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, boolvar2 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ fs[ri[inodekey(m0)]].directory ∧ ¬ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∨ fs[ri[inodekey(m0)]].directory ∧ boolvar2 ∧ m1 = fs[ri[inodekey(m0)]].nlink ∧ m2 = fs[ri[inodekey(m0)]].nsubdirs ∧ m3 = fs[ri[inodekey(m0)]].size ⊦ ⟪ choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?}; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m0).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m4, m5, m6).meta, inodenode(inodekey(m), md, true, m4, m5, m6).directory, inodenode(inodekey(m), md, true, m4, m5, m6).nlink, inodenode(inodekey(m), md, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m), md, true, m4, m5, m6).size)}⟫ (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: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-cons(ri, fs); (ss)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ inodekey(0) ∈ ri; (s)