[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 17 from proof refine-lookup (previous step)

jvalid ↔ key ∈ ri, err = ESUCCESS, err = err0, jvalid, nd = nd0, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1.keys.inodes?, p_os.keys.inodes?, jro1 < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro0), inv(gstore1), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range ri), refsize-cons(gstore1, range fi1), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(ri), ri-inj(fi1), key ∈ ri, pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid4 → jvalid0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS ∧ jvalid then let gnd = ? in {index_read_gnd#(ri[key], ri, fi1, jro0, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; gnd; err); if err = ESUCCESS then nd := gnd.nd}⟫ ⟨aubifs_core_index_lookup#(key, ri, fi1, jro1.keys, p_os.keys, nodes(gstore2 ↓, jro0), abs-log(nx, gstore2 ↓), jvalid4; jvalid3, nd0; err1)⟩ ((jvalid4 → jvalid0) ∧ (jvalid ↔ jvalid3) ∧ nd = nd0 ∧ err = err1), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information