Proof step 283 from proof inv-truncate (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

• Proof step 284:

  fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, adr4 = adr1, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), nd1 = truncnode(inodekey(m), m2), fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n ⊦ ⟪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; boolvar := ?; boolvar0 := boolvar; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.data)}⟫ (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)), m2 % VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory, buf-opt.some?

• Proof step 528:

  fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, adr4 = adr1, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data:= fill(fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n0), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), nd1 = truncnode(inodekey(m), m2), fs[ri[datakey(m, m2 / VFS_PAGE_SIZE)]].data?, fs[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), ri[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri, ri[inodekey(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; boolvar0 := boolvar; if err = ESUCCESS then aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := true; inode := mkinode(inode.ino, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.size); if boolvar1 then buf-opt := some(nd.data)}⟫ (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)), m2 % VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory, buf-opt.some?

Rule argument

Additional information