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

(ino = m3 ⊃ mkfile(m6, md1, # links(m3, cache_dirs), content1 upto min(m6, m2));cache_files[ino]) = mkfile(m8, md3, m9, content), cache_icache[ino] = mkientry(boolvar, mkinode(m, md, false, m4, m5, m7)), cache_files[m3] = mkfile(m1, md2, # links(m3, cache_dirs), content1), (∅)[m3] = mkientry(boolvar1, mkinode(m10, md4, boolvar0, m11, m12, m13)), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), ino ∈ cache_icache[m3, mkientry(false, mkinode(m3, md1, false, # links(m3, cache_dirs), 0, m6))], m3 ∈ cache_files, ino ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ (ino = m3 ⊃ mkfile(m6, md1, # links(m3, cache_dirs), (content1 ⊕ mkcontent(m3, cache_pcache0)) upto min(m6, m2)) ;((cache_files ⊕ cache_pcache0) ⊕ cache_icache)[ino] ) = mkfile(m7, md, m4, content ⊕ mkcontent(ino, truncate(m3, min(m6, m2), cache_pcache0))), ino = m3, m3 ∈ cache_icache, datakey(m3, m2 / VFS_PAGE_SIZE) ∈ cache_pcache0, m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content1 ⊕ mkcontent(m3, cache_pcache0), m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 1265:
cache_files[ino] = mkfile(m8, md3, # links(ino, cache_dirs), content), cache_icache[ino] = mkientry(boolvar, mkinode(m, md, false, m4, m5, m7)), cache_files[m3] = mkfile(m1, md2, # links(m3, cache_dirs), content1), (∅)[m3] = mkientry(boolvar1, mkinode(m10, md4, boolvar0, m11, m12, m13)), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), ino ∈ cache_icache, m3 ∈ cache_files, ino ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ ((cache_files ⊕ cache_pcache0) ⊕ cache_icache)[ino] = mkfile(m7, md, m4, content ⊕ mkcontent(ino, truncate(m3, min(m6, m2), cache_pcache0))), m3 ∈ cache_icache, datakey(m3, m2 / VFS_PAGE_SIZE) ∈ cache_pcache0, m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content1 ⊕ mkcontent(m3, cache_pcache0), m2 ≤ m6 ∧ m2 % VFS_PAGE_SIZE ≠ 0 ∧ m2 / VFS_PAGE_SIZE ∈ content1

Rule argument

Additional information

Used simplifier rules: afs-cons-file-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n, content) → # links(ino, dirs) = n; (forward) from specification afs-base% ⊦ ino ≠ ino0 → (ino ∈ icache[ino0, ie] ↔ ino ∈ icache); (s)