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

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, boolvar ↔ true, err = ESUCCESS, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), key = datakey(m, m2 / VFS_PAGE_SIZE), nd = datanode(key, buf-opt.buf), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), fs[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, buf-opt.some?, 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), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, m2 ≤ n, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪pageno := min(n, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size); key1 := inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).ino); key0 := inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).ino); if err = ESUCCESS then if boolvar then {nd.data := fill (nd.data, zero, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE, VFS_PAGE_SIZE - mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE); aubifs_core_journal_add3#(truncnode(inodekey(m), min(n, m2)), nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri)} else aubifs_core_journal_add2#(truncnode(inodekey(m), min(n, m2)), nd0, ri, fi, ro, fo; adr1, adr0, fs, log; boolvar0, err); if err = ESUCCESS then {aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(key1, pageno, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := boolvar; 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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 20:
# buf-opt.buf = VFS_PAGE_SIZE, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, boolvar, err = ESUCCESS, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), nd = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf-opt.buf), nd0 = inodenode(inodekey(m), md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, n), m2 % VFS_PAGE_SIZE ≠ 0, fs[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, buf-opt.some?, 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(m)] ∈ fs, inodekey(m) ∈ ri, m2 ≤ n, ¬ fs[ri[inodekey(m)]].directory ⊦ ⟪pageno := m2; key1 := inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).ino); key0 := inodekey(mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).ino); if err = ESUCCESS then if boolvar then {nd.data := fill (nd.data, zero, mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE, VFS_PAGE_SIZE - mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2).size % VFS_PAGE_SIZE); aubifs_core_journal_add3#(truncnode(inodekey(m), min(n, m2)), nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar0, err); if err = ESUCCESS then aubifs_core_index_store#(datakey(m, m2 / VFS_PAGE_SIZE), adr, fi, ro, fo, fs, log, boolvar0; ri)} else aubifs_core_journal_add2#(truncnode(inodekey(m), min(n, m2)), nd0, ri, fi, ro, fo; adr1, adr0, fs, log; boolvar0, err); if err = ESUCCESS then {aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_truncate#(key1, pageno, fi, ro, fo, fs, log, boolvar0; ri); boolvar1 := boolvar; 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))

Rule argument

Additional information

Used simplifier rules: min-comm: ⊦ min(n0, n1) = min(n1, n0); from specification min-max% ⊦ n0 ≤ n1 → min(n0, n1) = n0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)