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

fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), 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), inodekey(m) ∈ ri, ¬ fs[ri[inodekey(m)]].directory, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪aubifs_truncate#(n, m2 / VFS_PAGE_SIZE, fi, ro, fo; buf-opt, inode, boolvar, err, ri, fs, log, boolvar0)⟫ (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 nonrec nowhile calls applied rule call right

And obtained the following new goals

Proof step 6:
boolvar1 ↔ boolvar, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO ↔ inodekey(m) ∈ ro, inode = mkinode(m, md, false, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, m2), pageno1 = m2 / VFS_PAGE_SIZE, 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), inodekey(m) ∈ ri, buf-opt.some? → # buf-opt.buf = VFS_PAGE_SIZE ⊦ ⟪if pre-truncate(inode, n, pageno1, buf-opt, fs, ri, ro) then choose adr1, adr0, adr, boolvar with true in let key1 = inodekey(inode.ino), key0 = inodekey(inode.ino), pageno0 = inode.size % VFS_PAGE_SIZE, pageno = min(n, inode.size) in let key = datakey(inode.ino, pageno1), nd1 = truncnode(key1, pageno), nd0 = inodenode(key0, inode.meta, inode.directory, inode.nlink, inode.nsubdirs, n), nd = ? in {if inode.size ≤ n ∧ pageno0 ≠ 0 then if buf-opt.some? then {nd := datanode(key, buf-opt.buf); boolvar := true, err := ESUCCESS} else aubifs_core_index_lookup#(key, ri, fi, ro, fo, fs, log, boolvar0; boolvar, nd; err) else boolvar := false, err := ESUCCESS; if err = ESUCCESS then if boolvar then {nd.data := fill(nd.data, zero, pageno0, VFS_PAGE_SIZE - pageno0); aubifs_core_journal_add3#(nd1, 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#(nd1, 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)}} else abort⟫ (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)), VFS_PAGE_SIZE = 0, fs[ri[inodekey(m)]].directory

Rule argument

pos: right 1

Additional information

Used simplifier rules: truncate: ⊦ ;% ⊦ VFS_PAGE_SIZE ≠ 0; (s)