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

gstore2[n1] = groupblock(gndx, lax, 0), fs = nodes(gstore2 ↓, jro0), log = abs-log(nx, gstore2 ↓), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, jro1.keys.inodes?, p_os.keys.inodes?, fi1.inos < pmaxino, p_os < pmaxino, jro1 < jmaxino, ri.inos < jmaxino, inv(gstore2 \ jro0), inv(gstore1), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range ri), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(ri), n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, ri.lebs ⊆ dom gstore2, ¬ dups(nx), ¬ n1 ∈ nx, jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), jvalid5 → jvalid ⊦ [index_deallocate_gnd#(n1, ri, fi1, gstore1, nx, pmaxino, p_os, true; jro0, gstore2; err0)] ( (jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ ri.lebs ⊆ dom gstore2 ∧ refsize-cons(gstore2, range ri) ∧ inv(gstore2 \ jro0) ∧ elems nx ∩ jro0 = ∅ ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0 → ⟨ri0 := ri; aubifs_core_journal_gc#(fi1, jro1.keys, p_os.keys; ri, fs, log; jvalid5)⟩ (ri0 = ri ∧ log = abs-log(nx, gstore2 ↓) ∧ fs = nodes(gstore2 ↓, jro0)))

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 378:
jvalid ↔ true, gstore2[n1] = groupblock(gndx, lax, 0), fi = fi1, fi0 = ri, fs = nodes(gstore2 ↓, jro0), gstore = gstore2, gstore0 = gstore1, jro = jro0, log = abs-log(nx, gstore2 ↓), n = n1, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, p_os.keys.inodes?, jro1.keys.inodes?, ri.inos < jmaxino, jro1 < jmaxino, p_os < pmaxino, fi1.inos < pmaxino, inv(gstore1), inv(gstore2 \ jro0), 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), n1 ∈ gstore1, n1 ∈ gstore2, pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid5 → jvalid0, jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ [if jvalid ∧ n ∈ gstore ∧ ¬ n ∈ nx then {fail_or_success#(; ; err); if err = ESUCCESS then gstore := gstore -- n, jro := jro ++ n} else abort] ( (jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ ri.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range ri) ∧ inv(gstore \ jro) ∧ elems nx ∩ jro = ∅ ∧ dom gstore1 ∪ elems nx = dom gstore ∪ jro → ⟨ri0 := ri; aubifs_core_journal_gc#(fi1, jro1.keys, p_os.keys; ri, fs, log; jvalid5)⟩ (ri0 = ri ∧ log = abs-log(nx, gstore ↓) ∧ fs = nodes(gstore ↓, jro))), jmaxino = 0, pmaxino = 0, dups(nx), n1 ∈ nx

Rule argument

pos: right 1

Additional information

Used simplifier rules: index_deallocate_gnd# (N, PRI, PFI, PSTORE0, PNL, PMAXINO, P_OS, ISYNCED ; PINVAL, PSTORE ; ERR ) {if ISYNCED ∧ N ∈ PSTORE ∧ ¬ N ∈ PNL then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then PSTORE := PSTORE -- N, PINVAL := PINVAL ++ N} else abort };