[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 566 from proof inv-truncate (previous step)

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, adr = adr2, adr0 = adr1, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = nd1, nd0 = truncnode(inodekey(m), m2), nd1 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), fs[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd0.key, nd0), node-cons(nd.key, nd), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, m2 ≤ n ⊦ ⟪ choose adr1, adr2 with new(adr1 ' + adr2 ', fs) ∧ ¬ dups(adr1 ' + adr2 ') in {adr0 := adr1, adr := adr2; fs := fs[adr0, nd0][adr, nd], log := (log + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr0 := ?, adr := ?}; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_truncate#(inodekey(m), m2, fi, ro, fo, fs, log, boolvar; ri); boolvar1 := false; inode := mkinode(inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.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?, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information