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

files0[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), fs = abs-files(files0), root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), afs-cons(dirs, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), of-cons(of, dirs, files0), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ROOT_INO ∈ dirs, ino2 ∈ files0, psynced → asynced0 ⊦ pre-truncate(path, n, ESUCCESS, user, root, fs, abs-of(of)) ∧ ⟨err0 := ESUCCESS; if err0 = ESUCCESS then let fid = root[path].fid in let buf = fs[fid].content in fs[fid] := mkfile(fs[fid].meta, resize(buf, n)); psynced := ?⟩ (fs = abs-files(files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]) ∧ (psynced → asynced) ∧ ESUCCESS = err0), root[path].dir?, ino2 ∈ dirs, m0 ≤ n ∧ m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 221:
⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files))
Proof step 222:
files0[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), fs = abs-files(files0), root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files0), afs-cons(dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), fids-cons(root, abs-files(files0), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files0), of-cons(of, dirs, files0), of-cons(of, dirs, files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files0), ino2 ∈ files0, ROOT_INO ∈ dirs, ¬ root[path].dir?, ¬ ino2 ∈ dirs, psynced → asynced0 ⊦ pw(user, path, root, fs) ∧ ⟨err0 := ESUCCESS; if err0 = ESUCCESS then let fid = root[path].fid in let buf = fs[fid].content in fs[fid] := mkfile(fs[fid].meta, resize(buf, n)); psynced := ?⟩ (fs = abs-files(files0[ino2, mkfile(n, md0, # links(ino2, dirs), content0 upto min(n, m0))]) ∧ (psynced → asynced) ∧ ESUCCESS = err0), m0 ≤ n ∧ m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0

Rule argument

Additional information

Used simplifier rules: path-in-eq: ⊦ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (p ∈ tree ↔ ispath(p, ino, dirs, files));% ⊦ ispath(p, n, m, dirs, files) → ispath(p, n, dirs, files); (s)%⊦ pre-truncate(p, n, ESUCCESS, user, root, fs, ofh) ↔ p ∈ root ∧ ¬ root[p].dir? ∧ pw(user, p, root, fs); (s)