[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 6 from proof crash-neutral-read (previous step)

err0 = err1, n0 = n, psynced, root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0), n ≤ # buf ⊦ ∃ err. pre-read(fd, n0, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in choose n with n ≤ n0 ∧ fh.pos + n ≤ # f.content in {n0 := n; buf := copy(f.content, fh.pos, buf, 0, n0); ofh[fd].pos := fh.pos + n0} ifnone n0 := 0 else n0 := ?⟩ (psynced ∧ posix-crash(root, fs, ofh, tree, fs0, ofh0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 7:
root.dir?, fids-cons(root, fs, ofh), posix-crash(root, fs, ofh, tree, fs0, ofh0), n ≤ # buf ⊦ ∃ err. pre-read(fd, n, err, user, root, fs, ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in choose n1 with n1 ≤ n ∧ fh.pos + n1 ≤ # f.content in {n := n1; buf := copy(f.content, fh.pos, buf, 0, n); ofh[fd].pos := fh.pos + n} ifnone n := 0 else n := ?⟩ posix-crash(root, fs, ofh, tree, fs0, ofh0)

Proof step 6 from proof crash-neutral-read (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information