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

# lax = # gndx0, jvalid2 ↔ jvalid1, gstore2[n1] = groupblock(gndx0, lax, m0), fi2 = fi2, fi3 = fi1, fi4 = fi2, gstore2 = gstore2, gstore3 = gstore1, gstore4 = gstore2, jmaxino = jmaxino, jmaxino2 = jmaxino, jro0 = jro0, jro2 = jro1, jro3 = jro0, ndx = nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)], ndx = ndx, ndx0 = ndx, nx = nx, nx1 = nx, p_os0 = p_os, pmaxino0 = pmaxino, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(groupblock(gndx0, lax, m0)), inv(gstore1), inv(gstore2 \ jro0), inv-journal(nx, gstore2, gstore1, jro0), key-cons(ndx), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi2), ri-inj(fi1), n1 ∈ gstore1, n1 ∈ gstore2, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ndx.keys.toSet ⊆ dom fi2, range fi2 ⊆ dom nodes(gstore2 ↓, jro0), jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ [gjournal_gc_copy#(jvalid1, fi1, gstore1, pmaxino, p_os; ndx, jvalid4, jmaxino0, jmaxino, fi2, jro0, gstore2, nx, jvalid; err)] ( jro2 < jmaxino ∧ pmaxino0 ≤ jmaxino ∧ fi2.inos < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi2) ∧ inv-journal(nx, gstore2, gstore3, jro0) ∧ ri-inj(fi2) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ jmaxino2 ≤ jmaxino ∧ dom gstore4 ⊆ dom gstore2 ∧ (nx.toSet \ nx1.toSet) ∩ dom gstore4 = ∅ ∧ (∃ ax, ndx, ndx1. ndx0 = ndx + ndx1 ∧ (err = ESUCCESS → ndx1 = []) ∧ new(ax, nodes(gstore4 ↓, jro3)) ∧ # ax = # ndx ∧ ¬ dups(ax) ∧ fi2 = fi4[ndx.keys, ax] ∧ nodes(gstore2 ↓, jro0) = nodes(gstore4 ↓, jro3)[ax, ndx] ∧ abs-log(nx, gstore2 ↓) = abs-log(nx1, gstore4 ↓) + ax) → ⟪if err ≠ ESUCCESS then debug#("gjournal: failed to copy nodes of LEB " + n1.toString + " to journal head during GC"); if err = ESUCCESS then index_sync#(fi2, fi1, jro0, gstore2, gstore1, nx, pmaxino, p_os; ; jvalid, err); if err = ESUCCESS then index_deallocate_gnd#(n1, fi2, fi1, gstore1, nx, pmaxino, p_os, jvalid; jro0, gstore2; err)⟫ ( jro1 < jmaxino ∧ pmaxino ≤ jmaxino ∧ fi2.inos < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi2) ∧ inv(gstore2 \ jro0) ∧ elems nx ∩ jro0 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0 ∧ ri-inj(fi2))), jmaxino = 0, m0 = 0, pmaxino = 0, dups(ndx.keys), dups(nx), n1 ∈ nx, n1 ∈ jro0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 64:
# lax = # gndx0, gstore2[n1] = groupblock(gndx0, lax, m0), fi4 = fi2, gstore4 = gstore2, jmaxino2 = jmaxino, jro3 = jro0, ndx = nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)], ndx0 = nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)], nx1 = nx, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, m0 ≠ 0, pmaxino ≠ 0, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(gstore2 \ jro0), inv(gstore1), inv(groupblock(gndx0, lax, m0)), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(fi2), n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, range fi2 ⊆ dom nodes(gstore2 ↓, jro0), fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, ¬ dups(nx), ¬ dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)].keys), ¬ n1 ∈ jro0, ¬ n1 ∈ nx, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ [gjournal_gc_copy#(jvalid1, fi1, gstore1, pmaxino, p_os; ndx, jvalid4, jmaxino0, jmaxino, fi2, jro0, gstore2, nx, jvalid; err)] ( jro1 < jmaxino ∧ pmaxino ≤ jmaxino ∧ fi2.inos < jmaxino ∧ jmaxino ≠ 0 ∧ (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi2) ∧ inv(gstore2 \ jro0) ∧ elems nx ∩ jro0 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0 ∧ ri-inj(fi2) ∧ (err = ESUCCESS ∨ ⌊err⌋ ) ∧ jmaxino2 ≤ jmaxino ∧ dom gstore4 ⊆ dom gstore2 ∧ (nx.toSet \ nx1.toSet) ∩ dom gstore4 = ∅ ∧ (∃ ax, ndx, ndx1. ndx0 = ndx + ndx1 ∧ (err = ESUCCESS → ndx1 = []) ∧ new(ax, nodes(gstore4 ↓, jro3)) ∧ # ax = # ndx ∧ ¬ dups(ax) ∧ fi2 = fi4[ndx.keys, ax] ∧ nodes(gstore2 ↓, jro0) = nodes(gstore4 ↓, jro3)[ax, ndx] ∧ abs-log(nx, gstore2 ↓) = abs-log(nx1, gstore4 ↓) + ax) → ⟪if err ≠ ESUCCESS then debug#("gjournal: failed to copy nodes of LEB " + n1.toString + " to journal head during GC"); if err = ESUCCESS then index_sync#(fi2, fi1, jro0, gstore2, gstore1, nx, pmaxino, p_os; ; jvalid, err); if err = ESUCCESS then index_deallocate_gnd#(n1, fi2, fi1, gstore1, nx, pmaxino, p_os, jvalid; jro0, gstore2; err)⟫ ( (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range fi2) ∧ inv(gstore2 \ jro0) ∧ elems nx ∩ jro0 = ∅ ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0))

Rule argument

Additional information

Used simplifier rules: ⊦ inv-journal(nx, gstore, gstore0, ginval) ↔ inv(gstore \ ginval) ∧ inv(gstore0) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ remove-refsize0(gstore0) = gstore0; (s)% ⊦ ri-cons(ri, fs) → key-cons(fs[referenced-adrs(ax, ri)]); (s)% ⊦ ri-cons(ri, fs) → fs[referenced-adrs(ax, ri)].keys.toSet ⊆ dom ri; (s)