[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 920 from proof refine-truncate-buff-none-uncached (previous step)

asynced2 ↔ asynced5, asynced0 ↔ inode.size ≤ n ∧ old_ino ≠ 0 ∧ (pageno ∈ content ∨ buf-opt.some?), cache_files[m] = mkfile(m1, md2, # links(m, cache_dirs), content1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m] = mkfile(m0, md0, # links(m, cache_dirs), content0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, ¬ asynced0, buf-opt = none, content = files0[inode.ino].content, dirs = cache_dirs, err = ESUCCESS, files = files0[ino, files0[ino].content:= (content upto size)], files0 = cache_files, ino = inode.ino, inode = mkinode(m, md, false, # links(m, cache_dirs), 0, m2), new_inode = inode, old_ino = inode.size % VFS_PAGE_SIZE, old_ino0 = 0, pageno = m2 / VFS_PAGE_SIZE, size = min(n, inode.size), size0 = 0, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), m ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪afs_inode_sync#(new_inode.size:= n; dirs, files); inode := getinode(inode.ino, dirs, files); err := ESUCCESS; asynced := ?; asynced1 := asynced0; if err = ESUCCESS then let asynced0 = false in {icache_set#(inode, asynced0; err, cache_icache); pcache_truncate#(inode.ino, m2, n; err, cache_pcache); if asynced1 then pcache_set#(inode.ino, m2 / VFS_PAGE_SIZE, buf-opt.buf, asynced0; err, cache_pcache)}; if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m, md, false, # links(m, cache_dirs), 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, inode0, asynced5, err0, cache_dirs, afs_files, cache_asynced)⟩ ( cache_dirs = dirs ∧ afs_files = (files ⊕ cache_pcache) ⊕ cache_icache ∧ (cache_asynced ↔ asynced) ∧ buf-opt = buf-opt0 ∧ inode = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0), VFS_PAGE_SIZE = 0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ cache_pcache

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 921:
cache_files[m] = mkfile(m1, md2, # links(m, cache_dirs), content1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m] = mkfile(m0, md0, # links(m, cache_dirs), content0), dirs = cache_dirs, files = cache_files[m, mkfile(m1, md2, # links(m, cache_dirs), content1 upto min(n, m2))], afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), m ∈ cache_files, ¬ datakey(m, m2 / VFS_PAGE_SIZE) ∈ cache_pcache, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪afs_inode_sync#(mkinode(m, md, false, # links(m, cache_dirs), 0, n); dirs, files); inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ); err := ESUCCESS; asynced := ?; asynced1 := false; buf-opt := none; afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; if err = ESUCCESS then let asynced0 = false in {icache_set#(inode, asynced0; err, cache_icache); pcache_truncate#(inode.ino, m2, n; err, cache_pcache); if asynced1 then pcache_set#(inode.ino, m2 / VFS_PAGE_SIZE, buf-opt.buf, asynced0; err, cache_pcache)}; if ¬ asynced1 ∨ err ≠ ESUCCESS then buf-opt := none⟫ ⟨buf-opt0 := none; inode0 := mkinode(m, md, false, # links(m, cache_dirs), 0, m2); afs_truncate#(n, m2 / VFS_PAGE_SIZE; buf-opt0, inode0, asynced5, err0, cache_dirs, afs_files, cache_asynced)⟩ ( cache_dirs = dirs ∧ afs_files = (files ⊕ cache_pcache) ⊕ cache_icache ∧ (cache_asynced ↔ asynced) ∧ buf-opt = buf-opt0 ∧ inode = inode0 ∧ (asynced1 ↔ asynced5) ∧ err = err0), m2 ≤ n ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content1

Rule argument

Additional information

Used simplifier rules: ⊦ mkfile(m, md, m0, content).content:= content0 = mkfile(m, md, m0, content0); (s)% ⊦ mkfile(m, md, m0, content).content = content; (s)%⊦ getinode(ino, dirs, files) = (ino ∈ dirs ⊃ mkinode (ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); (s)%⊦ mkinode(m, md, boolvar, m0, m1, m2).size:= m6 = mkinode(m, md, boolvar, m0, m1, m6); (s)% ⊦ VFS_PAGE_SIZE ≠ 0; (s)% ⊦ ¬ none.some?; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)