[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 1 from proof copied-DMSQInv-thm (conclusion) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ∧ DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) → DMSQInv(gs0, lsf0, pcf0)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)), ¬ DMSQInv(gs0, lsf0, pcf0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQstep, seq:⊦ DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalFLUSHHEAD ∧ gs0 = gs.phead:= gs.vhead ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ (∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid) ;τ ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( ( gs .ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= ( r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next ;gs.qrl )) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None) ;gs.owns ) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid) ;τ ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( ( gs .ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= ( gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head ;gs.orl )) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail ;gs.qrl ) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ a = globalCRASH ∧ ⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH (ps, phead, pretRefs, prvHp ; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := ( ( ( ( (gs.vs:= vs) .vhead:= vhead) .vtail:= vtail) .vretRefs:= vretRefs) .vrvHp:= vrvHp) .owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), subst:[lsf, a, gs0, pcf, gs, lsf0, pcf0] → [lsf, a, gs0, pcf, gs, lsf0, pcf0], <all paths>

Additional information

Used terms: lsf, a, gs0, pcf, gs, lsf0, pcf0

Proof step 3 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) ↔ (∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalFLUSHHEAD ∧ gs0 = gs.phead:= gs.vhead ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ (∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ a = globalCRASH ∧ ⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf)

A spec-lemma

Proof step 4 from proof copied-DMSQInv-thm (previous step) (back to tree)

(∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc)) ∨ a = globalFLUSHHEAD ∧ gs0 = gs.phead:= gs.vhead ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ (∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ a = globalCRASH ∧ ⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 5 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ tid, ls, pc. lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) ∧ lsf0 = lsf(tid; ls) ∧ pcf0 = pcf(tid; pc) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 6 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQInv(gs, lsf, pcf), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ¬ DMSQInv(gs0, lsf0, pcf0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 7 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 8 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 9 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 10 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, subst:[a, ls0, pc0, pc, gs0, ls, gs] → [a, ls, pc, pcf(tid), gs0, lsf(tid), gs]

Additional information

Used terms: a, ls, pc, pcf(tid), gs0, lsf(tid), gs

Proof step 11 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

Lemma step-DMSQLInv

Proof step 12 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) → DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls, pc) ∧ lsf(tid).tid = ls.tid, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 5

Additional information

Proof step 13 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 14 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ¬ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 6 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 15 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 16 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 17 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, lsf0 = lsf(tid; ls), pcf0 = pcf(tid; pc), DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ (tid = tid0 ⊃ ls;lsf(tid0)).tid = tid0 ∧ DMSQLInv(gs0, (tid = tid0 ⊃ ls;lsf(tid0)), (tid = tid0 ⊃ pc;pcf(tid0)))

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: tid = tid0

Additional information

Used formulas: tid = tid0

Proof step 19 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, tid = tid0, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ (tid = tid0 ⊃ ls;lsf(tid0)).tid = tid0 ∧ DMSQLInv(gs0, (tid = tid0 ⊃ ls;lsf(tid0)), (tid = tid0 ⊃ pc;pcf(tid0)))

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 20 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid0).tid = ls.tid, ls.tid ≠ tid0, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid0), pcf(tid0), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 7 terms: tid0 abort: F discard: F computed: T

Additional information

Used terms: tid0

Proof step 21 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, tid ≠ tid0, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ (tid = tid0 ⊃ ls;lsf(tid0)).tid = tid0 ∧ DMSQLInv(gs0, (tid = tid0 ⊃ ls;lsf(tid0)), (tid = tid0 ⊃ pc;pcf(tid0)))

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 22 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, tid ≠ tid0, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ lsf(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf(tid0), pcf(tid0))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:other-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ ls.tid ≠ ls0.tid ∧ DMSQLInv(gs, ls0, pc0) ∧ lstep(gs, ls, pc, a, gs0, ls1, pc1) → DMSQLInv(gs0, ls0, pc0), subst:[a, ls0, pc0, pc, gs0, ls, gs, pc1, ls1] → [a, lsf(tid0), pcf(tid0), pcf(tid), gs0, lsf(tid), gs, pc, ls]

Additional information

Used terms: a, lsf(tid0), pcf(tid0), pcf(tid), gs0, lsf(tid), gs, pc, ls

Proof step 23 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ ls.tid ≠ ls0.tid ∧ DMSQLInv(gs, ls0, pc0) ∧ lstep(gs, ls, pc, a, gs0, ls1, pc1) → DMSQLInv(gs0, ls0, pc0)

Lemma other-DMSQLInv

Proof step 24 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, tid ≠ tid0, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ lsf(tid).tid ≠ lsf(tid0).tid ∧ DMSQLInv(gs, lsf(tid0), pcf(tid0)) ∧ lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) → DMSQLInv(gs0, lsf(tid0), pcf(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ lsf(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf(tid0), pcf(tid0))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 8 terms: tid0 abort: F discard: F computed: T

Additional information

Used terms: tid0

Proof step 25 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = ls.tid, lsf(tid0).tid = tid0, tid ≠ tid0, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs0, ls, pc), DMSQLInv(gs, lsf(tid0), pcf(tid0)), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ lsf(tid).tid ≠ lsf(tid0).tid ∧ DMSQLInv(gs, lsf(tid0), pcf(tid0)) ∧ lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc) → DMSQLInv(gs0, lsf(tid0), pcf(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ lsf(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf(tid0), pcf(tid0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 26 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid0).tid = tid0, lsf(tid).tid = ls.tid, tid ≠ tid0, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid0), pcf(tid0)), DMSQLInv(gs0, ls, pc), lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ lsf(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf(tid0), pcf(tid0)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ lsf(tid).tid ≠ lsf(tid0).tid ∧ DMSQLInv(gs, lsf(tid0), pcf(tid0)) ∧ lstep(gs, lsf(tid), pcf(tid), a, gs0, ls, pc)

User applied rule all left

And closed the goal!

Rule argument

pos: left 9 terms: tid abort: F discard: F computed: T

Additional information

Used terms: tid

Proof step 27 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 28 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 29 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQInv(gs, lsf, pcf), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 30 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 31 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 32 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 8

Additional information

Proof step 33 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 34 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 35 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHHEAD, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.phead:= gs.vhead → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs] → [lsf, gs0, pcf, tid, gs]

Additional information

Used terms: lsf, gs0, pcf, tid, gs

Proof step 36 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.phead:= gs.vhead → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHHEAD

Proof step 37 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.phead:= gs.vhead → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 38 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.phead:= gs.vhead

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 39 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 40 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 41 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 25

Additional information

Proof step 42 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s)

Proof step 43 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHHEAD, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.phead:= gs.vhead → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, gs0] → [gs, gs0]

Additional information

Used terms: gs, gs0

Proof step 44 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.phead:= gs.vhead → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHHEAD

Proof step 45 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.phead:= gs.vhead → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 46 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.phead:= gs.vhead

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ (gs.phead:= phead).ps = gs.ps; (s) ⊦ (gs.phead:= phead).owns = gs.owns; (s) ⊦ (gs.phead:= phead).pretRefs = gs.pretRefs; (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s) ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ (gs.phead:= phead).vtail = gs.vtail; (s) ⊦ (gs.phead:= phead).phead = phead; (s) ⊦ (gs.phead:= phead).orl = gs.orl; (s) ⊦ (gs.phead:= phead).qrl = gs.qrl; (s) ⊦ (gs.phead:= phead).vretRefs = gs.vretRefs; (s) ⊦ (gs.phead:= phead).rvowns = gs.rvowns; (s) ⊦ (gs.phead:= phead).vs = gs.vs; (s) ⊦ (gs.phead:= phead).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 47 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 48 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 24 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 49 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf(tid), pcf(tid), gs0]

Additional information

Used terms: gs, lsf(tid), pcf(tid), gs0

Proof step 50 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 51 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf(tid).tid, gs0) → DMSQLInv(gs0, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 37

Additional information

Used simplifier rules: ⊦ (gs.phead:= phead).orl = gs.orl; (s) ⊦ (gs.phead:= phead).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s)

Proof step 52 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf(tid).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 53 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ¬ DMSQRely(gs, lsf(tid).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf(tid).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ (gs.phead:= phead).vtail = gs.vtail; (s) ⊦ (gs.phead:= phead).phead = phead; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.phead:= phead).ps = gs.ps; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.phead:= phead).pretRefs = gs.pretRefs; (s) ⊦ (gs.phead:= phead).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.phead:= phead).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.phead:= phead).orl = gs.orl; (s) ⊦ (gs.phead:= phead).qrl = gs.qrl; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.phead:= phead).vhead = gs.vhead; (s) ⊦ (gs.phead:= phead).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.phead:= phead).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) Used terms: gs, lsf(tid).tid, gs0

Proof step 54 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 55 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 56 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 57 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 25

Additional information

Used simplifier rules: ⊦ (gs.phead:= phead).owns = gs.owns; (s) ⊦ (gs.phead:= phead).ps = gs.ps; (s) ⊦ (gs.phead:= phead).pretRefs = gs.pretRefs; (s) ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s) ⊦ (gs.phead:= phead).phead = phead; (s) ⊦ (gs.phead:= phead).vtail = gs.vtail; (s) ⊦ (gs.phead:= phead).orl = gs.orl; (s) ⊦ (gs.phead:= phead).qrl = gs.qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.phead:= phead).vretRefs = gs.vretRefs; (s) ⊦ (gs.phead:= phead).rvowns = gs.rvowns; (s) ⊦ (gs.phead:= phead).vs = gs.vs; (s) ⊦ (gs.phead:= phead).vhead = gs.vhead; (s)

Proof step 58 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, a = globalFLUSHHEAD, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 26

Additional information

Used simplifier rules: ⊦ (gs.phead:= phead).vtail = gs.vtail; (s) ⊦ (gs.phead:= phead).owns = gs.owns; (s) ⊦ (gs.phead:= phead).ps = gs.ps; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) ⊦ (gs.phead:= phead).pretRefs = gs.pretRefs; (s) ⊦ (gs.phead:= phead).vrvHp = gs.vrvHp; (s) ⊦ (gs.phead:= phead).prvHp = gs.prvHp; (s) ⊦ (gs.phead:= phead).phead = phead; (s) ⊦ (gs.phead:= phead).orl = gs.orl; (s) ⊦ (gs.phead:= phead).qrl = gs.qrl; (s) ⊦ (gs.phead:= phead).vretRefs = gs.vretRefs; (s) ⊦ (gs.phead:= phead).rvowns = gs.rvowns; (s) ⊦ (gs.phead:= phead).vs = gs.vs; (s) ⊦ (gs.phead:= phead).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 59 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 60 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 61 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHHEAD, gs0 = gs.phead:= gs.vhead, lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 62 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 63 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 64 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 65 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 66 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = globalFLUSHVAL(r) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] ∧ lsf0 = lsf ∧ pcf0 = pcf, ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 67 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 68 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 11

Additional information

Proof step 69 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 70 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHVAL, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs, r] → [lsf, gs0, pcf, tid, gs, r]

Additional information

Used terms: lsf, gs0, pcf, tid, gs, r

Proof step 71 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHVAL

Proof step 72 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 73 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 74 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 75 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs.vrvHp = dom gs.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.vs, r ∈ gs.ps, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val]

User applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid

Proof step 76 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 77 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Proof step 78 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHVAL, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, r, gs0] → [gs, r, gs0]

Additional information

Used terms: gs, r, gs0

Proof step 79 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHVAL

Proof step 80 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 81 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 82 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 83 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 25 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 84 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf0(tid), pcf0(tid), gs0]

Additional information

Used terms: gs, lsf0(tid), pcf0(tid), gs0

Proof step 85 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 86 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 38 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 87 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s)

Proof step 88 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s)

Proof step 89 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQRely(gs, lsf0(tid).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf0(tid).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, lsf0(tid).tid, gs0

Proof step 90 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 91 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 92 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 93 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Used simplifier rules: ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s)

Proof step 94 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 28

Additional information

Used simplifier rules: ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 95 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 96 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 97 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = globalFLUSHVAL(r), gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val], lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 98 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 99 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 100 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 101 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 102 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) ∧ lsf0 = lsf ∧ pcf0 = pcf, ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 103 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 104 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 11

Additional information

Proof step 105 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 106 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHNEXT, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next ;gs.qrl )) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None) ;gs.owns ) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs, r] → [lsf, gs0, pcf, tid, gs, r]

Additional information

Used terms: lsf, gs0, pcf, tid, gs, r

Proof step 107 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHNEXT

Proof step 108 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 109 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 110 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 111 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs.vrvHp = dom gs.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.vs, r ∈ gs.ps, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns)

User applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid

Proof step 112 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 113 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Proof step 114 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHNEXT, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next ;gs.qrl )) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None) ;gs.owns ) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, r, gs0] → [gs, r, gs0]

Additional information

Used terms: gs, r, gs0

Proof step 115 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHNEXT

Proof step 116 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 117 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 118 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 119 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 25 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 120 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf0(tid), pcf0(tid), gs0]

Additional information

Used terms: gs, lsf0(tid), pcf0(tid), gs0

Proof step 121 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 122 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 38 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 123 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s)

Proof step 124 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s)

Proof step 125 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQRely(gs, lsf0(tid).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf0(tid).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ x = x + y ↔ y = []; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, lsf0(tid).tid, gs0

Proof step 126 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 127 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 128 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 129 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Used simplifier rules: ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s)

Proof step 130 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 28

Additional information

Used simplifier rules: ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 131 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s)

Proof step 132 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 133 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ doEnq(gs.owns(gs.vs[r].next).tid);τ), gs0 = ((gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]).qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s) Used terms: tid

Proof step 134 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 135 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 136 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 137 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 138 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ r. a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf, ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 139 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 140 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 11

Additional information

Proof step 141 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 142 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHOPTTID, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= ( gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head ;gs.orl )) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail ;gs.qrl ) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs, r] → [lsf, gs0, pcf, tid, gs, r]

Additional information

Used terms: lsf, gs0, pcf, tid, gs, r

Proof step 143 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHOPTTID

Proof step 144 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 145 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 146 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 147 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs.vrvHp = dom gs.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs.orl ≠ [], r ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), r ∈ gs.vs, r ∈ gs.ps, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)

User applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid

Proof step 148 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 149 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Proof step 150 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHOPTTID, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= ( gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head ;gs.orl )) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail ;gs.qrl ) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, r, gs0] → [gs, r, gs0]

Additional information

Used terms: gs, r, gs0

Proof step 151 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHOPTTID

Proof step 152 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 153 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 154 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 155 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 25 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 156 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf0(tid), pcf0(tid), gs0]

Additional information

Used terms: gs, lsf0(tid), pcf0(tid), gs0

Proof step 157 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 158 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 38 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 159 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s)

Proof step 160 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s)

Proof step 161 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQRely(gs, lsf0(tid).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf0(tid).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ x + a = x + a '; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, lsf0(tid).tid, gs0

Proof step 162 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 163 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 164 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 165 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), r ∈ gs.ps, r ∈ gs.vs, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Used simplifier rules: ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s)

Proof step 166 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), dom gs0.vrvHp = dom gs0.prvHp, gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], r ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, r ∈ gs.vs, r ∈ gs.ps, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 28

Additional information

Used simplifier rules: ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 167 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s)

Proof step 168 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.vs, r ∈ gs.ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 169 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ doDeq(gs.vs[r].deqID.tid);τ), gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl), lsf0 = lsf, pcf0 = pcf, r ≠ null, DMSQGInv(gs), r ∈ gs.ps, r ∈ gs.vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ x + a = x + a '; (s) Used terms: tid

Proof step 170 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 171 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 172 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 173 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 174 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. a = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) ∧ lsf0 = lsf ∧ pcf0 = pcf, ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 175 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 176 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 8

Additional information

Proof step 177 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 178 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHRETREF, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs] → [lsf, gs0, pcf, tid, gs]

Additional information

Used terms: lsf, gs0, pcf, tid, gs

Proof step 179 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHRETREF

Proof step 180 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 181 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 182 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 183 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs.vrvHp = dom gs.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid))

User applied rule all left

And closed the goal!

Rule argument

pos: left 19 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid

Proof step 184 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 185 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 186 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHRETREF, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, gs0, tid] → [gs, gs0, tid]

Additional information

Used terms: gs, gs0, tid

Proof step 187 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHRETREF

Proof step 188 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 21

Additional information

Proof step 189 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs

Proof step 190 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 191 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 22 terms: tid0 abort: F discard: T computed: F

Additional information

Used terms: tid0

Proof step 192 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid0) = gs0.vretRefs(tid0), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid0, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0) ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf0(tid0), pcf0(tid0), gs0]

Additional information

Used terms: gs, lsf0(tid0), pcf0(tid0), gs0

Proof step 193 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 194 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid0) = gs0.vretRefs(tid0), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid0, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid0), pcf0(tid0)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid0).tid, gs0) → DMSQLInv(gs0, lsf0(tid0), pcf0(tid0)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 35 terms: tid0 abort: F discard: T computed: T

Additional information

Used terms: tid0

Proof step 195 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid0).tid = tid0, gs.vretRefs(tid0) = gs0.vretRefs(tid0), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid0), pcf(tid0)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid0, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid0), pcf0(tid0)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid0).tid, gs0) → DMSQLInv(gs0, lsf0(tid0), pcf0(tid0)), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0) ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 35

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s)

Proof step 196 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid0).tid = tid0, gs.vretRefs(tid0) = gs0.vretRefs(tid0), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid0), pcf(tid0)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid0, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid0), pcf0(tid0)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid0).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s)

Proof step 197 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid0).tid = tid0, gs.vretRefs(tid0) = gs0.vretRefs(tid0), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid0), pcf(tid0)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid0, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQRely(gs, lsf0(tid0).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0) ⊦ lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf0(tid0).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, lsf0(tid0).tid, gs0

Proof step 198 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 199 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 200 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 201 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Used simplifier rules: ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s)

Proof step 202 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 25

Additional information

Used simplifier rules: ⊦ (gs.pretRefs:= vretRefs0).vtail = gs.vtail; (s) ⊦ (gs.pretRefs:= vretRefs0).owns = gs.owns; (s) ⊦ (gs.pretRefs:= vretRefs0).ps = gs.ps; (s) ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ (gs.pretRefs:= vretRefs0).phead = gs.phead; (s) ⊦ (gs.pretRefs:= vretRefs0).orl = gs.orl; (s) ⊦ (gs.pretRefs:= vretRefs0).qrl = gs.qrl; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vs = gs.vs; (s) ⊦ (gs.pretRefs:= vretRefs0).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 203 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 204 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 205 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)), lsf0 = lsf, pcf0 = pcf, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid0).tid = tid0 ∧ DMSQLInv(gs0, lsf0(tid0), pcf0(tid0))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid0 abort: F discard: T computed: T

Additional information

Used terms: tid0

Proof step 206 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0), ∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 207 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 208 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 209 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 210 from proof copied-DMSQInv-thm (previous step) (back to tree)

DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rvref. a = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf, ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 211 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 212 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 11

Additional information

Proof step 213 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 214 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-FLUSHRVHP, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns (gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed (gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), subst:[lsf, gs0, pcf, tid, gs, rvref] → [lsf, gs0, pcf, tid, gs, rvref]

Additional information

Used terms: lsf, gs0, pcf, tid, gs, rvref

Proof step 215 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)

Lemma step-FLUSHRVHP

Proof step 216 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 9

Additional information

Proof step 217 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 218 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 219 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs.vrvHp = dom gs.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs.orl ≠ [], rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]]

User applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: tid abort: F discard: T computed: T

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) Used terms: tid

Proof step 220 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: DMSQGInv(gs0)

Additional information

Used formulas: DMSQGInv(gs0)

Proof step 221 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Proof step 222 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:rely-FLUSHRVHP, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), subst:[gs, rvref, gs0] → [gs, rvref, gs0]

Additional information

Used terms: gs, rvref, gs0

Proof step 223 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns))

Lemma rely-FLUSHRVHP

Proof step 224 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 24

Additional information

Proof step 225 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]]

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used simplifier rules: ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) Used terms: gs

Proof step 226 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 227 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 25 terms: tid abort: F discard: T computed: F

Additional information

Used terms: tid

Proof step 228 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), DMSQGInv(gs0), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:stable-DMSQLInv, seq:⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc), subst:[gs, ls, pc, gs0] → [gs, lsf0(tid), pcf0(tid), gs0]

Additional information

Used terms: gs, lsf0(tid), pcf0(tid), gs0

Proof step 229 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc)

Lemma stable-DMSQLInv

Proof step 230 from proof copied-DMSQInv-thm (previous step) (back to tree)

gs.vretRefs(tid) = gs0.vretRefs(tid), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs0), DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 38 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 231 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0) → DMSQLInv(gs0, lsf0(tid), pcf0(tid)), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 38

Additional information

Used simplifier rules: ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s)

Proof step 232 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs0), DMSQGInv(gs), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl0. gs.orl + rl0 = gs0.orl, ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)), DMSQGInv(gs) ∧ DMSQLInv(gs, lsf0(tid), pcf0(tid)) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, lsf0(tid).tid, gs0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s)

Proof step 233 from proof copied-DMSQInv-thm (previous step) (back to tree)

lsf(tid).tid = tid, gs.vretRefs(tid) = gs0.vretRefs(tid), a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), DMSQGInv(gs0), DMSQLInv(gs, lsf(tid), pcf(tid)), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ DMSQRely(gs, lsf0(tid).tid, gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid) ⊦ lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQRely, seq:⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ ( gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns), subst:[gs, tid, gs0] → [gs, lsf0(tid).tid, gs0], <all paths>

Additional information

Used simplifier rules: ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x = x + y ↔ y = []; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ ownsRely(tid, owns, owns); (s) Used terms: gs, lsf0(tid).tid, gs0

Proof step 234 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQRely(gs, tid, gs0) ↔ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid) = gs0.vretRefs(tid) ∧ (gs.pretRefs(tid) = gs0.pretRefs(tid) ∨ gs.vretRefs(tid) = gs0.pretRefs(tid)) ∧ rvownsrely(tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid, gs.owns, gs0.owns)

A spec-lemma

Proof step 235 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ DMSQGInv(gs0), ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs0], <all paths>

Additional information

Used terms: gs0

Proof step 236 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 237 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, gs0.phead ∈ gs0.orl, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, ¬ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∨ dups(gs0.orl + gs0.qrl) ∨ ¬ markedp(gs0.orl, gs0.ps) ∨ ¬ markedp(gs0.orl, gs0.vs) ∨ ¬ unmarkedp(gs0.qrl, gs0.ps) ∨ gs0.orl = [] ∨ ¬ gs0.phead ∈ gs0.orl ∨ ¬ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.vretRefs, gs0.vrvHp) ∨ ¬ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∨ ¬ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∨ ¬ allocrv(gs0.pretRefs, gs0.prvHp) ∨ dom gs0.vrvHp ≠ dom gs0.prvHp ∨ ¬ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∨ (gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs))) ∧ (gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs)) ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl).last ∧ (gs0.qrl = [] ∨ gs0.vtail ≠ (gs0.orl + gs0.qrl.butlast).last ∨ gs0.vs[gs0.qrl.last].deqID ≠ None ∨ gs0.vs[(gs0.orl + gs0.qrl).last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 27

Additional information

Used simplifier rules: ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s)

Proof step 238 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, dom gs0.vrvHp = dom gs0.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, gs0.orl ≠ [], rvref ≠ null, DMSQGInv(gs), allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ dups(gs0.orl + gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), ¬ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs0.orl.last ≠ gs0.vhead ∨ ¬(gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)), gs0.orl.butlast = [] ∨ gs0.orl.butlast.last ≠ gs0.vhead ∨ gs0.phead = gs0.orl.last ∨ ¬ unmarkedp(gs0.qrl, gs0.vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 28

Additional information

Used simplifier rules: ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ a ∈ st → dom st ++ a = dom st; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 239 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 240 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 10

Additional information

Proof step 241 from proof copied-DMSQInv-thm (previous step) (back to tree)

a = τ, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], lsf0 = lsf, pcf0 = pcf, rvref ≠ null, DMSQGInv(gs), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 242 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, DMSQInv(gs, lsf, pcf), ¬ DMSQInv(gs0, lsf0, pcf0) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs, lsf, pcf], <all paths>

Additional information

Used terms: gs, lsf, pcf

Proof step 243 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 244 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, DMSQGInv(gs), ¬ DMSQInv(gs0, lsf0, pcf0), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQInv, seq:⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, pcf] → [gs0, lsf0, pcf0], <all paths>

Additional information

Used terms: gs0, lsf0, pcf0

Proof step 245 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQInv(gs, lsf, pcf) ↔ DMSQGInv(gs) ∧ (∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

A spec-lemma

Proof step 246 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule assign left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 247 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Additional information

Used formulas: ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

Proof step 248 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 15

Additional information

Proof step 249 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule weakening

And obtained the following new goals

Rule argument

poslist: left 15

Additional information

Proof step 250 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-CRASH, seq:⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) → ⟪ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH (ps, phead, pretRefs, prvHp ; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := ( ( ( ((gs.vs:= vs).vhead:= vhead) .vtail:= vtail) .vretRefs:= vretRefs) .vrvHp:= vrvHp) .owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), subst:[gs, lsf, tid, pcf] → [gs, lsf, tid, pcf]

Additional information

Used terms: gs, lsf, tid, pcf

Proof step 251 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) → ⟪ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))

Lemma step-CRASH

Proof step 252 from proof copied-DMSQInv-thm (previous step) (back to tree)

( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) → ⟪ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), ⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 253 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [gs], <all paths>

Additional information

Used terms: gs

Proof step 254 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 255 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, dom gs.vrvHp = dom gs.prvHp, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 256 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, dom gs.vrvHp = dom gs.prvHp, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 28 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 257 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟪ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), ⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule assign left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 258 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟪CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))), ⟨CRASH(ps0, phead0, pretRefs0, prvHp0; vs0, vhead0, vtail0, vretRefs0, vrvHp0, owns0, pcf); gs := (((((gs.vs:= vs0).vhead:= vhead0).vtail:= vtail0).vretRefs:= vretRefs0).vrvHp:= vrvHp0).owns:= owns0⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, owns0 = gs.owns, phead = gs.phead, phead0 = gs.phead, pretRefs = gs.pretRefs, pretRefs0 = gs.pretRefs, prvHp = gs.prvHp, prvHp0 = gs.prvHp, ps = gs.ps, ps0 = gs.ps, vhead = gs.vhead, vhead0 = gs.vhead, vretRefs = gs.vretRefs, vretRefs0 = gs.vretRefs, vrvHp = gs.vrvHp, vrvHp0 = gs.vrvHp, vs = gs.vs, vs0 = gs.vs, vtail = gs.vtail, vtail0 = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule contract call left

And obtained the following new goals

Rule argument

poslist: left 1, left 2

Additional information

Proof step 259 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps0, phead0, pretRefs0, prvHp0; vs0, vhead0, vtail0, vretRefs0, vrvHp0, owns0, pcf)⟩ ( ⟨gs := (((((gs.vs:= vs0).vhead:= vhead0).vtail:= vtail0).vretRefs:= vretRefs0).vrvHp:= vrvHp0).owns:= owns0⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf) ∧ ⟪gs := (((((gs.vs:= vs0).vhead:= vhead0).vtail:= vtail0).vretRefs:= vretRefs0).vrvHp:= vrvHp0).owns:= owns0⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)))), a = globalCRASH, owns = gs.owns, owns0 = gs.owns, phead = gs.phead, phead0 = gs.phead, pretRefs = gs.pretRefs, pretRefs0 = gs.pretRefs, prvHp = gs.prvHp, prvHp0 = gs.prvHp, ps = gs.ps, ps0 = gs.ps, vhead = gs.vhead, vhead0 = gs.vhead, vretRefs = gs.vretRefs, vretRefs0 = gs.vretRefs, vrvHp = gs.vrvHp, vrvHp0 = gs.vrvHp, vs = gs.vs, vs0 = gs.vs, vtail = gs.vtail, vtail0 = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule split left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 260 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟪gs := (((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf1(tid))), ⟨gs := (((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf1), ⟨CRASH(ps0, phead0, pretRefs0, prvHp0; vs0, vhead0, vtail0, vretRefs0, vrvHp0, owns0, pcf)⟩ (vs0 = vs1 ∧ vhead0 = vhead1 ∧ vtail0 = vtail1 ∧ vretRefs0 = vretRefs1 ∧ vrvHp0 = vrvHp1 ∧ owns0 = owns1 ∧ pcf = pcf1), a = globalCRASH, owns = gs.owns, owns0 = gs.owns, phead = gs.phead, phead0 = gs.phead, pretRefs = gs.pretRefs, pretRefs0 = gs.pretRefs, prvHp = gs.prvHp, prvHp0 = gs.prvHp, ps = gs.ps, ps0 = gs.ps, vhead = gs.vhead, vhead0 = gs.vhead, vretRefs = gs.vretRefs, vretRefs0 = gs.vretRefs, vrvHp = gs.vrvHp, vrvHp0 = gs.vrvHp, vs = gs.vs, vs0 = gs.vs, vtail = gs.vtail, vtail0 = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule assign left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 261 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨gs := (((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf1), ⟨CRASH(ps0, phead0, pretRefs0, prvHp0; vs0, vhead0, vtail0, vretRefs0, vrvHp0, owns0, pcf)⟩ (vs0 = vs1 ∧ vhead0 = vhead1 ∧ vtail0 = vtail1 ∧ vretRefs0 = vretRefs1 ∧ vrvHp0 = vrvHp1 ∧ owns0 = owns1 ∧ pcf = pcf1), a = globalCRASH, dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp = dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp, owns = gs.owns, owns0 = gs.owns, phead = gs.phead, phead0 = gs.phead, pretRefs = gs.pretRefs, pretRefs0 = gs.pretRefs, prvHp = gs.prvHp, prvHp0 = gs.prvHp, ps = gs.ps, ps0 = gs.ps, vhead = gs.vhead, vhead0 = gs.vhead, vretRefs = gs.vretRefs, vretRefs0 = gs.vretRefs, vrvHp = gs.vrvHp, vrvHp0 = gs.vrvHp, vs = gs.vs, vs0 = gs.vs, vtail = gs.vtail, vtail0 = gs.vtail, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp), allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp), listp ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).owns), markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps), markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs), nonullRetRefs ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs), rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns), rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns), unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead ∈ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ¬ dups ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ≠ null ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID ≠ None → ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid)) = Claimed (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last = ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∧ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ≠ [] → unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.tail, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs)) ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast ≠ [] ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast.last = ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead ≠ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last ∧ unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail = ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ≠ [] ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail = ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.butlast ).last ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.last ] .deqID = None ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ] .next = null ⊦

User applied rule assign left

And obtained the following new goals

Rule argument

pos: left 1

Additional information

Proof step 262 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps0, phead0, pretRefs0, prvHp0; vs0, vhead0, vtail0, vretRefs0, vrvHp0, owns0, pcf)⟩ (vs0 = vs1 ∧ vhead0 = vhead1 ∧ vtail0 = vtail1 ∧ vretRefs0 = vretRefs1 ∧ vrvHp0 = vrvHp1 ∧ owns0 = owns1 ∧ pcf = pcf1), a = globalCRASH, dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp = dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp, gs0 = (((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf0 = lsf, owns = gs.owns, owns0 = gs.owns, pcf0 = pcf1, phead = gs.phead, phead0 = gs.phead, pretRefs = gs.pretRefs, pretRefs0 = gs.pretRefs, prvHp = gs.prvHp, prvHp0 = gs.prvHp, ps = gs.ps, ps0 = gs.ps, vhead = gs.vhead, vhead0 = gs.vhead, vretRefs = gs.vretRefs, vretRefs0 = gs.vretRefs, vrvHp = gs.vrvHp, vrvHp0 = gs.vrvHp, vs = gs.vs, vs0 = gs.vs, vtail = gs.vtail, vtail0 = gs.vtail, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp), allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp), listp ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).owns), markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs), markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps), nonullRetRefs ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs), rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns), rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns), unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead ∈ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ¬ dups ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ≠ null ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID ≠ None → ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid)) = Claimed (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail = ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ≠ [] ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail = ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.butlast ).last ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.last ] .deqID = None ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ] .next = null, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last = ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∧ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ≠ [] → unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.tail, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs)) ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast ≠ [] ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast.last = ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead ≠ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last ∧ unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs), ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ (gs.vhead:= phead0).vhead = phead0; (s) ⊦ (gs.vtail:= phead1).vhead = gs.vhead; (s) ⊦ (gs.vretRefs:= vretRefs).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.vhead:= phead0).vs = gs.vs; (s) ⊦ (gs.vtail:= phead1).vs = gs.vs; (s) ⊦ (gs.vretRefs:= vretRefs).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.vhead:= phead0).rvowns = gs.rvowns; (s) ⊦ (gs.vtail:= phead1).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).vretRefs = vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.vhead:= phead0).qrl = gs.qrl; (s) ⊦ (gs.vtail:= phead1).qrl = gs.qrl; (s) ⊦ (gs.vretRefs:= vretRefs).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.vhead:= phead0).orl = gs.orl; (s) ⊦ (gs.vtail:= phead1).orl = gs.orl; (s) ⊦ (gs.vretRefs:= vretRefs).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.vtail:= phead1).vtail = phead1; (s) ⊦ (gs.vretRefs:= vretRefs).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.vhead:= phead0).phead = gs.phead; (s) ⊦ (gs.vtail:= phead1).phead = gs.phead; (s) ⊦ (gs.vretRefs:= vretRefs).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.vhead:= phead0).prvHp = gs.prvHp; (s) ⊦ (gs.vtail:= phead1).prvHp = gs.prvHp; (s) ⊦ (gs.vretRefs:= vretRefs).prvHp = gs.prvHp; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vhead:= phead0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vtail:= phead1).pretRefs = gs.pretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.vhead:= phead0).ps = gs.ps; (s) ⊦ (gs.vtail:= phead1).ps = gs.ps; (s) ⊦ (gs.vretRefs:= vretRefs).ps = gs.ps; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s)

Proof step 263 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs1, vrvHp1), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, vs1), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs1, vrvHp1, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ vs1, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null, gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), ¬ DMSQGInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1) ∨ lsf(tid).tid ≠ tid ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 31

Additional information

Proof step 264 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(vretRefs1, vrvHp1), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, gs.ps), markedp(gs.orl, vs1), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(vretRefs1, vrvHp1, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ vs1, gs.phead ∈ gs.ps, ¬ DMSQGInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQGInv, seq:⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null), subst:[gs] → [ ( ( ( ((gs.vs:= vs1).vhead:= vhead1) .vtail:= vtail1) .vretRefs:= vretRefs1) .vrvHp:= vrvHp1) .owns:= owns1], <all paths>

Additional information

Used terms: ( ( (((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1) .vretRefs:= vretRefs1) .vrvHp:= vrvHp1) .owns:= owns1

Proof step 265 from proof copied-DMSQInv-thm (previous step) (back to tree)

⊦ DMSQGInv(gs) ↔ listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)

A spec-lemma

Proof step 266 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs1, vrvHp1), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, vs1), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs1, vrvHp1, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ vs1, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null, gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), ¬ listp ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).owns) ∨ dups ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl) ∨ ¬ markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps) ∨ ¬ markedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs) ∨ ¬ unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).ps) ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl = [] ∨ ¬ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead ∈ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl ∨ ¬ rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns) ∨ ¬ allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp) ∨ ¬ nonullRetRefs ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs) ∨ ¬ rvownerok (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns) ∨ ¬ allocrv (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).pretRefs, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp) ∨ dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vrvHp ≠ dom ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).prvHp ∨ ¬ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ≠ null ∧ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID ≠ None → ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).rvowns (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vretRefs (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid)) = Claimed (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .deqID .tid, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ] .next ] .val)) ∨ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last ≠ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∨ ¬ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ≠ [] → unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.tail, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs))) ∧ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast = [] ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.butlast.last ≠ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vhead ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).phead = ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl.last ∨ ¬ unmarkedp (((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl, ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs)) ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail ≠ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ∧ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl = [] ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vtail ≠ ( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.butlast ).last ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl.last ] .deqID ≠ None ∨ ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).vs [( ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).orl + ((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1).qrl ).last ] .next ≠ null) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.vhead:= phead0).qrl = gs.qrl; (s) ⊦ (gs.vtail:= phead1).qrl = gs.qrl; (s) ⊦ (gs.vretRefs:= vretRefs).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.vhead:= phead0).orl = gs.orl; (s) ⊦ (gs.vtail:= phead1).orl = gs.orl; (s) ⊦ (gs.vretRefs:= vretRefs).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.vhead:= phead0).vs = gs.vs; (s) ⊦ (gs.vtail:= phead1).vs = gs.vs; (s) ⊦ (gs.vretRefs:= vretRefs).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.vtail:= phead1).vtail = phead1; (s) ⊦ (gs.vretRefs:= vretRefs).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.vhead:= phead0).phead = gs.phead; (s) ⊦ (gs.vtail:= phead1).phead = gs.phead; (s) ⊦ (gs.vretRefs:= vretRefs).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.vhead:= phead0).vhead = phead0; (s) ⊦ (gs.vtail:= phead1).vhead = gs.vhead; (s) ⊦ (gs.vretRefs:= vretRefs).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.vhead:= phead0).rvowns = gs.rvowns; (s) ⊦ (gs.vtail:= phead1).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).vretRefs = vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.vhead:= phead0).prvHp = gs.prvHp; (s) ⊦ (gs.vtail:= phead1).prvHp = gs.prvHp; (s) ⊦ (gs.vretRefs:= vretRefs).prvHp = gs.prvHp; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vhead:= phead0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vtail:= phead1).pretRefs = gs.pretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.vhead:= phead0).ps = gs.ps; (s) ⊦ (gs.vtail:= phead1).ps = gs.ps; (s) ⊦ (gs.vretRefs:= vretRefs).ps = gs.ps; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.owns:= owns).owns = owns; (s)

Proof step 267 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(vretRefs1, vrvHp1), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, gs.ps), markedp(gs.orl, vs1), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(vretRefs1, vrvHp1, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ vs1, gs.phead ∈ gs.ps, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null, (gs.orl.last ≠ vhead1 ∨ ¬(gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1))) ∧ (gs.orl.butlast = [] ∨ gs.orl.butlast.last ≠ vhead1 ∨ gs.phead = gs.orl.last ∨ ¬ unmarkedp(gs.qrl, vs1)) ∨ vtail1 ≠ (gs.orl + gs.qrl).last ∧ (gs.qrl = [] ∨ vtail1 ≠ (gs.orl + gs.qrl.butlast).last ∨ vs1[gs.qrl.last].deqID ≠ None ∨ vs1[gs.qrl.last].next ≠ null) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 31

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 268 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(gs.pretRefs, gs.prvHp), allocrv(vretRefs1, vrvHp1), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, vs1), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(vretRefs1, vrvHp1, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ vs1, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null, gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), gs.orl.last ≠ vhead1 ∨ ¬(gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)), gs.orl.butlast = [] ∨ gs.orl.butlast.last ≠ vhead1 ∨ gs.phead = gs.orl.last ∨ ¬ unmarkedp(gs.qrl, vs1) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 32

Additional information

Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s)

Proof step 269 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(gs.ps, gs.phead, gs.pretRefs, gs.prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf)⟩ (vs = vs1 ∧ vhead = vhead1 ∧ vtail = vtail1 ∧ vretRefs = vretRefs1 ∧ vrvHp = vrvHp1 ∧ owns = owns1 ∧ pcf = pcf1), dom vrvHp1 = dom gs.prvHp, owns = gs.owns, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, gs.orl ≠ [], lsf(tid).tid ≠ tid, DMSQGInv(gs), DMSQLInv((((((gs.vs:= vs1).vhead:= vhead1).vtail:= vtail1).vretRefs:= vretRefs1).vrvHp:= vrvHp1).owns:= owns1, lsf(tid), pcf1(tid)), allocrv(vretRefs1, vrvHp1), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, vs1, gs.ps, owns1), markedp(gs.orl, gs.ps), markedp(gs.orl, vs1), nonullRetRefs(gs.orl + gs.qrl, vs1, vretRefs1, gs.pretRefs), rvownerok(vretRefs1, vrvHp1, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ vs1, gs.phead ∈ gs.ps, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), vs1[vhead1].next ≠ null ∧ vs1[vs1[vhead1].next].deqID ≠ None → gs.rvowns(vretRefs1(vs1[vs1[vhead1].next].deqID.tid)) = Claimed(vs1[vs1[vhead1].next].deqID.tid, vs1[vs1[vhead1].next].val), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), gs.orl.last = vhead1 ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, vs1)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = vhead1 ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, vs1), vtail1 = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ vtail1 = (gs.orl + gs.qrl.butlast).last ∧ vs1[gs.qrl.last].deqID = None ∧ vs1[gs.qrl.last].next = null ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 29 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof step 270 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ¬ DMSQGInv(gs0) ∨ (∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 15

Additional information

Proof step 271 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), ∃ tid. ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid)))

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 15

Additional information

Proof step 272 from proof copied-DMSQInv-thm (previous step) (back to tree)

⟨CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟩ (gs0 = gs ∧ lsf0 = lsf ∧ pcf0 = pcf), a = globalCRASH, owns = gs.owns, phead = gs.phead, pretRefs = gs.pretRefs, prvHp = gs.prvHp, ps = gs.ps, vhead = gs.vhead, vretRefs = gs.vretRefs, vrvHp = gs.vrvHp, vs = gs.vs, vtail = gs.vtail, DMSQGInv(gs), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ ∃ tid. ¬ DMSQGInv(gs0) ∨ ¬(lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))), lsf0(tid).tid = tid ∧ DMSQLInv(gs0, lsf0(tid), pcf0(tid))

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: tid abort: F discard: T computed: T

Additional information

Used terms: tid

Proof Tree for copied-DMSQInv-thm (View conclusion)

The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.

the proof tree