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

⟨afs_inode_sync#(mkinode(ino4, md, false, # links(ino4, dirs), 0, m0); dirs, files)⟩ (dirs = dirs0 ∧ files = files0), VFS_PAGE_SIZE = n0 + m0 % VFS_PAGE_SIZE, files1[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), files0[ino4] = mkfile(m, md0, m1, content1), files = files1 [ino4, mkfile(m0, md, # links(ino4, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ], m0 % VFS_PAGE_SIZE ≠ 0, files1 -- ino4 ≠ files0 -- ino4, afs-cons(dirs0, files0), afs-cons(dirs, files1), files1 ~ files0, ino4 ∈ files1, m0 / VFS_PAGE_SIZE ∈ content0 ⊦

Heuristic unfold applied rule call left

And obtained the following new goals

Proof step 203:
⟨let ino = inode.ino in if ino ∈ files then {files[ino].size := inode.size; files[ino].meta := inode.meta} else if ino ∈ dirs then dirs[ino].meta := inode.meta⟩ (dirs = dirs0 ∧ files = files0), VFS_PAGE_SIZE = n0 + m0 % VFS_PAGE_SIZE, files0[ino4] = mkfile(m, md0, m1, content1), files1[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), files = files1 [ino4, mkfile(m0, md, # links(ino4, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ], inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs, files1), afs-cons(dirs0, files0), files1 ~ files0, m0 / VFS_PAGE_SIZE ∈ content0, ino4 ∈ files1 ⊦ m0 % VFS_PAGE_SIZE = 0, files1 -- ino4 = files0 -- ino4

Rule argument

pos: left 1

Additional information

Used simplifier rules: afs_inode_sync#(INODE; DIRS, FILES) {let INO = INODE.ino in if INO ∈ FILES then {FILES[INO].size := INODE.size; FILES[INO].meta := INODE.meta} else if INO ∈ DIRS then DIRS[INO].meta := INODE.meta };