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

# buf-opt0.buf = VFS_PAGE_SIZE, ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[m3] = mkfile(m0, md0, # links(m3, cache_dirs), content0), cache_files[m3] = mkfile(m1, md2, # links(m3, cache_dirs), content1), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, ino = m3, n = m6, pcache = cache_pcache, size = m2, buf-opt0.some?, 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), m3 ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache) ⊦ ⟪if ∀ key. key ∈ pcache → key.data? then pcache := truncate(ino, min(n, size), pcache) else abort; inode1 := (m3 ∈ cache_dirs ⊃ mkinode(m3, cache_dirs[m3].meta, true, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, cache_dirs[m3].size) ;mkinode (m3, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).meta, false, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).nlink, 0, (m3 ∈ cache_files ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[m3]).size) ); buf-opt := buf-opt0; asynced4 := false; cache_pcache := pcache; if asynced4 then pcache_set#(inode1.ino, m2 / VFS_PAGE_SIZE, buf-opt.buf, false; err, cache_pcache); if (¬ asynced4 ∨ err ≠ ESUCCESS) ∧ ¬ buf-opt0.some? then buf-opt := none⟫ ⟨inode0 := mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; cache_dirs0 := cache_dirs; afs_truncate#(m6, m2 / VFS_PAGE_SIZE; buf-opt0, inode0, asynced5, err0, cache_dirs, afs_files, cache_asynced)⟩ ( cache_dirs = cache_dirs3 ∧ afs_files = (cache_files[m3, mkfile(m6, md1, # links(m3, cache_dirs2), content1 upto min(m6, m2))] ⊕ cache_pcache) ⊕ cache_icache[m3, mkientry(false, mkinode(m3, md1, false, # links(m3, cache_dirs0), 0, m6))] ∧ (cache_asynced ↔ asynced0) ∧ buf-opt = buf-opt0 ∧ inode1 = inode0 ∧ (asynced4 ↔ asynced5) ∧ err = err0), m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information