[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 41 from proof inv-rename-new-reparent (previous step)

m1 + 1 = fs[ri[inodekey(m)]].size, n0 + (boolvar2 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, fs[ri[dentrykey(m, str)]] = dentrynode(key, m3), fs[ri[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), m2 = fs[ri[inodekey(m)]].nlink, m6 = fs[ri[inodekey(m0)]].nlink, m7 = fs[ri[inodekey(m0)]].nsubdirs, m8 = fs[ri[inodekey(m0)]].size, m0 ≠ m, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].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(m3) ∈ ri, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(m3)] ∈ fs, ¬ inodekey(m0) ∈ ro, ¬ dentrykey(m0, str0) ∈ ri, ¬ inodekey(m) ∈ ro, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10 ⊦ ⟪aubifs_core_journal_add4# (dentrynode(dentrykey(m, str), 0), dentrynode(dentrykey(m0, str0), mkdentry(str, m3).ino), inodenode(inodekey(m), md, true, m2, n0, m1), inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1), ri, fi, ro, fo ; adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m0, str0), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m3).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, n0, m1).meta, inodenode(inodekey(m), md, true, m2, n0, m1).directory, inodenode(inodekey(m), md, true, m2, n0, m1).nlink, inodenode(inodekey(m), md, true, m2, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m2, n0, m1).size); new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).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))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 42:
n0 + (boolvar2 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, m1 + 1 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m3)]] = inodenode(key0, md1, boolvar0, m5, m9, m10), fs[ri[dentrykey(m, str)]] = dentrynode(key, m3), adr5 = adr1, adr6 = adr2, m2 = fs[ri[inodekey(m)]].nlink, m6 = fs[ri[inodekey(m0)]].nlink, m7 = fs[ri[inodekey(m0)]].nsubdirs, m8 = fs[ri[inodekey(m0)]].size, nd = inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1), nd0 = inodenode(inodekey(m), md, true, m2, n0, m1), nd1 = dentrynode(dentrykey(m0, str0), mkdentry(str, m3).ino), nd2 = dentrynode(dentrykey(m, str), 0), mkdentry(str, m3).dentry?, fs[ri[inodekey(m0)]].directory, 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[inodekey(m3)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(m0) ∈ ri, inodekey(m3) ∈ ri, dentrykey(m, str) ∈ ri, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m4 = m10, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd2.key, nd2) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3, adr4 with new(adr1 ' + adr2 ' + (adr3 ' + adr4), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ') in {adr6 := adr1, adr5 := adr2, adr0 := adr3, adr := adr4; fs := fs[adr6, nd2][adr5, nd1][adr0, nd0][adr, nd], log := (((log + adr6) + adr5) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr6 := ?, adr5 := ?, 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(m0, str0), adr5, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(str0, mkdentry(str, m3).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m2, n0, m1).meta, inodenode(inodekey(m), md, true, m2, n0, m1).directory, inodenode(inodekey(m), md, true, m2, n0, m1).nlink, inodenode(inodekey(m), md, true, m2, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m2, n0, m1).size); new_parent_inode0 := mkinode (m0, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).meta, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).directory, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nlink, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).nsubdirs, inodenode(inodekey(m0), md0, true, m6, m7 + (boolvar2 ⊃ 1;0), m8 + 1).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)), m0 = m, inodekey(m0) ∈ ro, dentrykey(m0, str0) ∈ ri, inodekey(m) ∈ ro

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_journal_add4# (ND1, ND2, ND3, ND4, RI, FI, RO, FO ; ADR1, ADR2, ADR3, ADR4, FS, LOG ; CSYNCED, ERR ) {if ri-cons(RI, FS) ∧ node-cons(ND1.key, ND1) ∧ node-cons(ND2.key, ND2) ∧ node-cons(ND3.key, ND3) ∧ node-cons(ND4.key, ND4) then { choose adr1, adr2, adr3, adr4 with new(adr1 ' + adr2 ' + (adr3 ' + adr4), FS) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ') in {ADR1 := adr1, ADR2 := adr2, ADR3 := adr3, ADR4 := adr4; FS := FS[ADR1, ND1][ADR2, ND2][ADR3, ND3][ADR4, ND4], LOG := (((LOG + ADR1) + ADR2) + ADR3) + ADR4, ERR := ESUCCESS} ifnone ERR := ENOSPC or {fail#(; ; ERR); ADR1 := ?, ADR2 := ?, ADR3 := ?, ADR4 := ?}; CSYNCED := ?} else abort };% ⊦ mkdentry(str, m).dentry?; (s)