[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 fwsim-step-retdeq (conclusion) (back to tree)

DMSQInv(gs, lsf, pcf), DMSQstep(mkstate(gs, lsf, pcf), retDEQ(tid, optval), mkstate(gs0, lsf0, pcf0)), abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

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 2 from proof fwsim-step-retdeq (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 3 from proof fwsim-step-retdeq (previous step) (back to tree)

DMSQGInv(gs), DMSQstep(mkstate(gs, lsf, pcf), retDEQ(tid, optval), mkstate(gs0, lsf0, pcf0)), abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

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, retDEQ(tid, optval), gs0, pcf, gs, lsf0, pcf0], <all paths>

Additional information

Used terms: lsf, retDEQ(tid, optval), gs0, pcf, gs, lsf0, pcf0

Proof step 4 from proof fwsim-step-retdeq (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 5 from proof fwsim-step-retdeq (previous step) (back to tree)

(∃ tid0, ls, pc. lstep(gs, lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc) ∧ lsf0 = lsf(tid0; ls) ∧ pcf0 = pcf(tid0; pc)) ∨ retDEQ(tid, optval) = globalFLUSHHEAD ∧ gs0 = gs.phead:= gs.vhead ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ (∃ r. retDEQ(tid, optval) = 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. retDEQ(tid, optval) = (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. retDEQ(tid, optval) = (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) ∨ (∃ tid0. retDEQ(tid, optval) = τ ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid0; gs.vretRefs(tid0)) ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ (∃ rvref. retDEQ(tid, optval) = τ ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] ∧ lsf0 = lsf ∧ pcf0 = pcf) ∨ retDEQ(tid, optval) = 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), DMSQGInv(gs), abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ globalCRASH ≠ retDEQ(tid, optval); (s) ⊦ retDEQ(tid, optval) ≠ τ; (s) ⊦ x + a = x + a '; (s) ⊦ globalFLUSHVAL(node) ≠ retDEQ(tid, optval); (s) ⊦ globalFLUSHHEAD ≠ retDEQ(tid, optval); (s)

Proof step 6 from proof fwsim-step-retdeq (previous step) (back to tree)

DMSQGInv(gs), abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), lstep(gs, lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc) ∧ lsf0 = lsf(tid0; ls) ∧ pcf0 = pcf(tid0; pc) ∨ retDEQ(tid, optval) = (vtail0 = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ doEnq(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid);τ) ∧ vtail0 ∈ gs.vs ∧ vtail0 ∈ gs.ps ∧ vtail0 ≠ null ∧ gs0 = ( (gs.ps:= gs.ps[vtail0, gs.ps[vtail0].next:= gs.vs[vtail0].next]) .qrl:= (vtail0 = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.qrl + gs.vs[(gs.orl + gs.qrl).last].next ' ;gs.qrl )) .owns:= (vtail0 = (gs.orl + gs.qrl).last ∧ gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊃ gs.owns(gs.vs[(gs.orl + gs.qrl).last].next; None) ;gs.owns ) ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ retDEQ(tid, optval) = (gs.qrl ≠ [] ∧ vhead0 = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ doDeq(gs.vs[gs.qrl.head].deqID.tid);τ) ∧ vhead0 ∈ gs.vs ∧ vhead0 ∈ gs.ps ∧ vhead0 ≠ null ∧ gs0 = ( (gs.ps:= gs.ps[vhead0, gs.ps[vhead0].deqID:= gs.vs[vhead0].deqID]) .orl:= (gs.qrl ≠ [] ∧ vhead0 = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.orl + gs.qrl.head ';gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ vhead0 = gs.qrl.head ∧ gs.vs[gs.qrl.head].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs

Proof step 7 from proof fwsim-step-retdeq (previous step) (back to tree)

gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), DMSQGInv(gs), abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(gs, lsf(tid), pcf(tid)), lstep(gs, lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc) ∧ lsf0 = lsf(tid0; ls) ∧ pcf0 = pcf(tid0; pc) ∨ retDEQ(tid, optval) = (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ doEnq(owns(vs[(orl + qrl).last].next).tid);τ) ∧ vtail0 ∈ vs ∧ vtail0 ∈ ps ∧ vtail0 ≠ null ∧ gs0 = ( (gs.ps:= ps[vtail0, ps[vtail0].next:= vs[vtail0].next]) .qrl:= (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl)) .owns:= (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns) ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ retDEQ(tid, optval) = (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ doDeq(vs[qrl.head].deqID.tid);τ) ∧ vhead0 ∈ vs ∧ vhead0 ∈ ps ∧ vhead0 ≠ null ∧ gs0 = ( (gs.ps:= ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID]) .orl:= (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl)) .qrl:= (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl:= qrl1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl1, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl:= qrl2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl2, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps:= ps1 = mkgs (ps1, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns:= owns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns0, rvowns); (s)

Proof step 8 from proof fwsim-step-retdeq (previous step) (back to tree)

DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc) ∧ lsf0 = lsf(tid0; ls) ∧ pcf0 = pcf(tid0; pc) ∨ retDEQ(tid, optval) = (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ doEnq(owns(vs[(orl + qrl).last].next).tid);τ) ∧ vtail0 ∈ vs ∧ vtail0 ∈ ps ∧ vtail0 ≠ null ∧ gs0 = mkgs (ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), orl, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns), rvowns) ∧ lsf0 = lsf ∧ pcf0 = pcf ∨ retDEQ(tid, optval) = (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ doDeq(vs[qrl.head].deqID.tid);τ) ∧ vhead0 ∈ vs ∧ vhead0 ∈ ps ∧ vhead0 ≠ null ∧ gs0 = mkgs (ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), owns, rvowns) ∧ lsf0 = lsf ∧ pcf0 = pcf ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 4

Additional information

Proof step 9 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf0 = lsf(tid0; ls), pcf0 = pcf(tid0; pc), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof fwsim-step-retdeq (previous step) (back to tree)

DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abs-def, seq:⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid)), subst:[alsf, lsf, q, apcf, pcf, gs] → [alsf, lsf, q, apcf, pcf, mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)], <all paths>

Additional information

Used terms: alsf, lsf, q, apcf, pcf, mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)

Proof step 11 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid))

A spec-lemma

Proof step 12 from proof fwsim-step-retdeq (previous step) (back to tree)

q = content (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s)

Proof step 13 from proof fwsim-step-retdeq (previous step) (back to tree)

DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 4 terms: tid0 abort: F discard: F computed: F

Additional information

Used terms: tid0

Proof step 14 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf(tid0).tid = tid0, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val, vtail2, optval1, vtail0, nd, lsf(tid0), addr, tid1, vtail1, vtail3, rvref, tid2, obsEmpty, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval0, node, nd, lsf(tid0), addr, tid1, lst, first, rvref, othertid, success, optval0

Proof step 15 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf(tid0) = mkls(tid1, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), tid1 = tid0, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 16 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf(tid0) = mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 6 terms: tid0 abort: F discard: F computed: F

Additional information

Used terms: tid0

Proof step 17 from proof fwsim-step-retdeq (previous step) (back to tree)

abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0)) = apcf(tid0), lsf(tid0) = mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)), absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0), pcf(tid0), alsf(tid0)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 18 from proof fwsim-step-retdeq (previous step) (back to tree)

abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)) = apcf(tid0), lsf(tid0) = mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), alsf(tid0)), lstep (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval), gs0, ls, pc), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:lstep, seq:⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a), subst:[a, ls0, pc0, pc, gs0, ls, gs] → [retDEQ(tid, optval), ls, pc, pcf(tid0), gs0, mkls (tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)], <all paths>

Additional information

Used terms: retDEQ(tid, optval), ls, pc, pcf(tid0), gs0, mkls (tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)

Proof step 19 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ lstep(gs, ls, pc, a, gs0, ls0, pc0) ↔ pre(gs, ls, pc, a) ∧ ls0 = lstepf(gs, ls, pc, a) ∧ gs0 = gstepf(gs, ls, pc, a) ∧ pc0 = pcstepf(gs, ls, pc, a)

A spec-lemma

Proof step 20 from proof fwsim-step-retdeq (previous step) (back to tree)

abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)) = apcf(tid0), gs0 = gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval)), ls = lstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval)), lsf(tid0) = mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pc = pcstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval)), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0)), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), alsf(tid0)), pre (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid0, val, optval0, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0), retDEQ(tid, optval)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf(tid0; ls), pcf(tid0; pc)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: pre-retDEQ: ⊦ pre(gs, ls, pc, retDEQ(tid, optval)) ↔ pc = D34 ∧ ls.tid = tid ∧ ls.optval = optval; ⊦ pcstepf(gs, ls, D34, a) = ready; (s) ⊦ lstepf (gs, mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D34, retDEQ(tid, optval)) = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (s) ⊦ gstepf (gs, mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D34, retDEQ(tid, optval)) = gs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s)

Proof step 21 from proof fwsim-step-retdeq (previous step) (back to tree)

abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34) = apcf(tid), lsf(tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abspc-def, seq:⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34

Proof step 22 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) )

A spec-lemma

Proof step 23 from proof fwsim-step-retdeq (previous step) (back to tree)

(D34 = idle ⊃ idle ;(D34 = ready ⊃ ready ;(D34 = crashed ⊃ crashed ;( D34 = E1 ∨ D34 = E2 ∨ D34 = E3 ∨ D34 = E4 ∧ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E10 ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null) ∨ D34 = E11 ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 ⊃ invEnq ;(D34 = E10 ∨ D34 = E11 ∨ D34 = E12 ∨ D34 = E4 ∨ D34 = E13 ∨ D34 = E17 ⊃ resEnq ;( D34 = D1 ∨ D34 = D2 ∨ D34 = D3 ∨ D34 = D4 ∨ D34 = D5 ∨ D34 = D6 ∧ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ D34 = D7 ∨ D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D20 ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None) ∨ D34 = D21 ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ) = apcf(tid), lsf(tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pre(gs, ls, resDeq, a) ↔ a = RetDeq(ls.tid, ls.oval); (s) ⊦ D33 ≠ D34; (s) ⊦ D32 ≠ D34; (s) ⊦ D31 ≠ D34; (s) ⊦ D30 ≠ D34; (s) ⊦ D29 ≠ D34; (s) ⊦ D28 ≠ D34; (s) ⊦ D27 ≠ D34; (s) ⊦ D26 ≠ D34; (s) ⊦ D25 ≠ D34; (s) ⊦ D21 ≠ D34; (s) ⊦ D20 ≠ D34; (s) ⊦ D19 ≠ D34; (s) ⊦ D18 ≠ D34; (s) ⊦ D17 ≠ D34; (s) ⊦ D16 ≠ D34; (s) ⊦ D14 ≠ D34; (s) ⊦ D13 ≠ D34; (s) ⊦ D12 ≠ D34; (s) ⊦ D11 ≠ D34; (s) ⊦ D10 ≠ D34; (s) ⊦ D9 ≠ D34; (s) ⊦ D8 ≠ D34; (s) ⊦ D7 ≠ D34; (s) ⊦ D6 ≠ D34; (s) ⊦ D5 ≠ D34; (s) ⊦ D4 ≠ D34; (s) ⊦ D3 ≠ D34; (s) ⊦ D2 ≠ D34; (s) ⊦ D1 ≠ D34; (s) ⊦ D34 ≠ E17; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E4; (s) ⊦ D34 ≠ E12; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D34 ≠ E1; (s) ⊦ D34 ≠ crashed; (s) ⊦ D34 ≠ ready; (s) ⊦ D34 ≠ idle; (s)

Proof step 24 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf(tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), DMSQLInv (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ RetDeq(tid, optval) = RetDeq(alsf(tid).tid, alsf(tid).oval) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval)))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:DMSQLInv, seq:⊦ DMSQLInv(gs, ls, pc) ↔ ( pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → ( ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ ( ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ; gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ ( gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ ( pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ( gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid) ;Claimed(ls.tid, ls.optval.val) )) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ ( pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ ( pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) ) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ ( pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) ;noowns(ls.tid, gs.owns) )) ∧ ( pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34

Proof step 25 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ DMSQLInv(gs, ls, pc) ↔ (pc = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( pc = D4 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ (pc = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( pc = D6 → (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first) ∧ (pc = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D10 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ ( pc = D11 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next)) ∧ (pc = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ (pc = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ (pc = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (pc = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ (pc = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = D20 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( pc = D21 → ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first)) ∧ (pc = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ (pc = D23 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref]) ∧ ( pc = D24 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = gs.prvHp[ls.rvref]) ∧ ( pc = D25 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ ( pc = D26 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.vhead = ls.first → gs.rvowns(gs.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D27 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs.vhead = ls.first → gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ ( pc = D28 → ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D29 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ ( pc = D30 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (pc = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( pc = D34 → ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (pc = E2 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E3 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E5 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( pc = E7 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E8 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next) ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ (pc = E9 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( pc = E10 → ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E11 → ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( pc = E12 → ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.vs[ls.lst].next = ls.node ∧ gs.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null) ∧ (pc = E13 → gs.owns(ls.node) = Some(ls.tid)) ∧ (pc = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( pc = E15 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (pc = E16 → gs.owns(ls.node) = Some(ls.tid)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ( pc = E4 ∨ pc = E10 → ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ gs.owns(ls.node) = Some(ls.tid) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.vs[ls.node] = mk(ls.value, None, null)) ∧ (pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → gs.ps[ls.node] = gs.vs[ls.node]) ∧ ( pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = D13 ∨ pc = D14 ∨ pc = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ¬ ls.success) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ( pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first) ∧ ( pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → ls.success ∧ gs.vretRefs(ls.tid) ∈ gs.vrvHp ∧ gs.vretRefs(ls.tid) ≠ null ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ (pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ (pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ∨ pc = E17 ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D16 ∨ pc = D17 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)) ∧ ( pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D18 ∨ pc = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs)) ∧ (pc = D22 ∨ pc = D23 ∨ pc = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs)) ∧ ( pc = crashed ∨ pc = idle ∨ pc = ready ∨ pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D15 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∨ pc = D21 ∨ pc = D22 ∨ pc = D23 ∨ pc = D24 ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ∨ pc = D34 ∨ pc = E1 ∨ pc = E12 ∨ pc = E17 → noowns(ls.tid, gs.owns)) ∧ ( pc = E2 ∨ pc = E3 ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ ( pc = E10 → (ls.success ⊃ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ (pc = E11 → (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ (pc = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)))

A spec-lemma

Proof step 26 from proof fwsim-step-retdeq (previous step) (back to tree)

lsf(tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)), D34 = D3 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ≠ null, D34 = D4 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ≠ null, D34 = D5 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = D6 → ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ] ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ]) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Empty ∨ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ⊃ Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ;Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val) ), D34 = D8 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first, D34 = D9 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst, D34 = D10 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next) ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ≠ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next), D34 = D11 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next) ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ≠ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next), D34 = D12 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next), D34 = D13 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = null, D34 = D14 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ] = Empty ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = null, D34 = D15 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ] = Empty ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ] = Empty, D34 = D16 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null, D34 = D17 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null, D34 = D18 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next, D34 = D19 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val), D34 = D20 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success) ∧ (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ⊃ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first) ∧ noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ; mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ), D34 = D21 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first) ∧ noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ≠ [] ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl.head ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first), D34 = D22 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next, D34 = D23 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ], D34 = D24 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ] ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ], D34 = D25 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID .tid)) = Claimed (( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ⊕ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs )[mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID .tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val)), D34 = D26 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid)) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val)), D34 = D27 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val)), D34 = D28 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val), D34 = D29 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val), D34 = D30 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).othertid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val), D34 = D31 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ] .next, D34 = D34 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ] ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).prvHp [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ] ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Empty ⊃ Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ;Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val) ), D34 = E2 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E3 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E5 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E6 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail), D34 = E7 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst), D34 = E8 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next) ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst), D34 = E9 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst), D34 = E10 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ≠ null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] .val = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).value ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Weak(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∨ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node), D34 = E11 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ≠ null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] .val = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).value ∧ ( mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Weak(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∨ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node), D34 = E12 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ≠ null, D34 = E13 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E14 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null, D34 = E15 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ≠ null, D34 = E16 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E2 ∨ D34 = E3 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ≠ null ∧ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, D34 = E4 ∨ D34 = E10 → ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node) = Some(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] = mk(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).value, None, null) ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ], D34 = E3 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] = mk(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).value, None, null), D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ] = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node ], D34 = D7 ∨ D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 → ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = D13 ∨ D34 = D14 ∨ D34 = D15 → ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Pending(mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid), D34 = E2 ∨ D34 = E3 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → ¬ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success, D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D15 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D20 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first, D34 = D18 ∨ D34 = D19 ∨ D34 = D20 ∨ D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first ≠ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst, D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D20 ∨ D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl from mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first, D34 = D5 ∨ D34 = D6 ∨ D34 = D7 ∨ D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D15 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D20 ∨ D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).pretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) = mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).rvref ≠ null, D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ≠ null ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).rvowns (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid)) = Claimed (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval.val) ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val), D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 → mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr ∈ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).addr ≠ null ∧ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval = Val (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .val), D34 = idle ∨ D34 = ready ∨ D34 = E1 ∨ D34 = E2 ∨ D34 = E3 ∨ D34 = E4 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E10 ∨ D34 = E11 ∨ D34 = E12 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 ∨ D34 = E17 ∨ D34 = D1 ∨ D34 = D2 ∨ D34 = D3 ∨ D34 = D4 ∨ D34 = D5 ∨ D34 = D6 ∨ D34 = D7 ∨ D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D15 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 ∨ D34 = D34 → nextnottid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D34 = D20 ∨ D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead ≠ mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first → nextnottid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D34 = crashed ∨ D34 = idle ∨ D34 = ready ∨ D34 = E1 ∨ D34 = E2 ∨ D34 = E3 ∨ D34 = E4 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E10 ∨ D34 = E11 ∨ D34 = E12 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 ∨ D34 = E17 ∨ D34 = D1 ∨ D34 = D2 ∨ D34 = D3 ∨ D34 = D4 ∨ D34 = D5 ∨ D34 = D6 ∨ D34 = D7 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 ∨ D34 = D34 → noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vhead, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D15 ∨ D34 = D18 ∨ D34 = D19 → noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).first, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D34 = D22 ∨ D34 = D23 ∨ D34 = D24 → noid (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).orl + mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs), D34 = crashed ∨ D34 = idle ∨ D34 = ready ∨ D34 = D1 ∨ D34 = D2 ∨ D34 = D3 ∨ D34 = D4 ∨ D34 = D5 ∨ D34 = D6 ∨ D34 = D7 ∨ D34 = D8 ∨ D34 = D9 ∨ D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14 ∨ D34 = D15 ∨ D34 = D16 ∨ D34 = D17 ∨ D34 = D18 ∨ D34 = D19 ∨ D34 = D20 ∨ D34 = D21 ∨ D34 = D22 ∨ D34 = D23 ∨ D34 = D24 ∨ D34 = D25 ∨ D34 = D26 ∨ D34 = D27 ∨ D34 = D28 ∨ D34 = D29 ∨ D34 = D30 ∨ D34 = D31 ∨ D34 = D32 ∨ D34 = D33 ∨ D34 = D34 ∨ D34 = E1 ∨ D34 = E12 ∨ D34 = E17 → noowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns), D34 = E2 ∨ D34 = E3 ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → oneowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps), D34 = E10 → (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ⊃ ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ≠ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ⊃ oneweakowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ) ;oneowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), D34 = E11 → ( mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ≠ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs [mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next ⊃ oneweakowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ;noowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ), D34 = E4 → (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ⊃ noowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns) ;oneowns (mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid, mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).node, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).owns, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vs, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ RetDeq(tid, optval) = RetDeq(alsf(tid).tid, alsf(tid).oval) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, optval, vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ D34; (s) ⊦ D4 ≠ D34; (s) ⊦ D5 ≠ D34; (s) ⊦ D6 ≠ D34; (s) ⊦ D8 ≠ D34; (s) ⊦ D9 ≠ D34; (s) ⊦ D10 ≠ D34; (s) ⊦ D11 ≠ D34; (s) ⊦ D12 ≠ D34; (s) ⊦ D13 ≠ D34; (s) ⊦ D14 ≠ D34; (s) ⊦ D15 ≠ D34; (s) ⊦ D16 ≠ D34; (s) ⊦ D17 ≠ D34; (s) ⊦ D18 ≠ D34; (s) ⊦ D19 ≠ D34; (s) ⊦ D20 ≠ D34; (s) ⊦ D21 ≠ D34; (s) ⊦ D22 ≠ D34; (s) ⊦ D23 ≠ D34; (s) ⊦ D24 ≠ D34; (s) ⊦ D25 ≠ D34; (s) ⊦ D26 ≠ D34; (s) ⊦ D27 ≠ D34; (s) ⊦ D28 ≠ D34; (s) ⊦ D29 ≠ D34; (s) ⊦ D30 ≠ D34; (s) ⊦ D31 ≠ D34; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .pretRefs = vretRefs0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ D34 ≠ E2; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E12; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E4; (s) ⊦ D33 ≠ D34; (s) ⊦ D32 ≠ D34; (s) ⊦ D7 ≠ D34; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs = ps0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vhead = phead0; (s) ⊦ D2 ≠ D34; (s) ⊦ D1 ≠ D34; (s) ⊦ D34 ≠ E17; (s) ⊦ D34 ≠ E1; (s) ⊦ D34 ≠ ready; (s) ⊦ D34 ≠ idle; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .orl = qrl0; (s) ⊦ D34 ≠ crashed; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns = owns; (s)

Proof step 27 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦ RetDeq(tid, prvHp[pretRefs(tid)]) = RetDeq(alsf(tid).tid, alsf(tid).oval) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])))))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), D34, alsf(tid)

Proof step 28 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 29 from proof fwsim-step-retdeq (previous step) (back to tree)

mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid = alsf(tid).tid, vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, D34 = E1 ∨ D34 = E2 ∨ D34 = E3 ∨ D34 = E4 ∧ ¬ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ D34 = E5 ∨ D34 = E6 ∨ D34 = E7 ∨ D34 = E8 ∨ D34 = E9 ∨ D34 = E10 ∧ ( mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null) ∨ D34 = E11 ∧ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null ∨ D34 = E13 ∨ D34 = E14 ∨ D34 = E15 ∨ D34 = E16 → mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).value = alsf(tid).ival, (D34 = D10 ∨ D34 = D11 ∨ D34 = D12 ∨ D34 = D13 ∨ D34 = D14) ∧ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt = null → alsf(tid).obsEmpty, D34 = D20 ∧ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∨ D34 = D21 ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID ≠ None ∨ D34 = D22 → alsf(tid).oval = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).optval, D34 = D15 ∨ D34 = D23 ∨ D34 = D24 ∨ D34 = D6 ∧ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ D34 = D34 → alsf(tid).oval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs (mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).tid) ], ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ RetDeq(tid, prvHp[pretRefs(tid)]) = RetDeq(alsf(tid).tid, alsf(tid).oval) ∧ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ RetDeq(tid, optval) = RetDeq(tid0, optval0) ↔ tid = tid0 ∧ optval = optval0; (ws) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E4; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D34 ≠ E1; (s) ⊦ D14 ≠ D34; (s) ⊦ D13 ≠ D34; (s) ⊦ D12 ≠ D34; (s) ⊦ D11 ≠ D34; (s) ⊦ D10 ≠ D34; (s) ⊦ D22 ≠ D34; (s) ⊦ D21 ≠ D34; (s) ⊦ D20 ≠ D34; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ D6 ≠ D34; (s) ⊦ D24 ≠ D34; (s) ⊦ D23 ≠ D34; (s) ⊦ D15 ≠ D34; (s)

Proof step 30 from proof fwsim-step-retdeq (previous step) (back to tree)

alsf(tid).oval = prvHp[pretRefs(tid)], vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), tid = alsf(tid).tid, vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ¬ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))))), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val1, val0, obsEmpty0, alsf(tid), optval, tid0, optval0]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty0, alsf(tid), oval, tid0, optval

Proof step 31 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], alsf(tid) = mkls(tid0, obsEmpty0, val0, optval, val1, optval0), lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), optval = prvHp[pretRefs(tid)], pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), tid = tid0, vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ¬ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid; mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid; ready)), mkstate (gstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)])), alsf(tid; lstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))), apcf(tid; pcstepf(mkgs(content(qrl, ps)), alsf(tid), resDeq, RetDeq(tid, prvHp[pretRefs(tid)]))))), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ pcstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = ready; (s) ⊦ lstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = mkls(tid, obsEmpty, ival, oval, value, oval); (s) ⊦ gstepf (gs, mkls(tid, obsEmpty, ival, oval, value, optval), resDeq, RetDeq(tid, oval)) = gs; (s)

Proof step 32 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ¬ abs (mkstate (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0; mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr)), pcf(tid0; ready)), mkstate(mkgs(content(qrl, ps)), alsf(tid0; mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, prvHp[pretRefs(tid0)])), apcf(tid0; ready))), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abs-def, seq:⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid)), subst:[alsf, lsf, q, apcf, pcf, gs] → [alsf (tid0 ; mkls (tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, prvHp[pretRefs(tid0)]) ), lsf (tid0 ; mkls (tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr) ), content(qrl, ps), apcf(tid0; ready), pcf(tid0; ready), mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)], <all paths>

Additional information

Used terms: alsf (tid0 ; mkls (tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, prvHp[pretRefs(tid0)]) ), lsf (tid0 ; mkls (tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr) ), content(qrl, ps), apcf(tid0; ready), pcf(tid0; ready), mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)

Proof step 33 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ abs(mkstate(gs, lsf, pcf), mkstate(mkgs(q), alsf, apcf)) ↔ q = content(gs.qrl, gs.ps) ∧ (∀ tid. absls(gs, lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(gs, lsf(tid), pcf(tid)) = apcf(tid))

A spec-lemma

Proof step 34 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), content(qrl, ps) ≠ content (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).qrl, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps) ∨ (∃ tid. ¬ ( absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0; mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr))(tid), pcf(tid0; ready)(tid), alsf(tid0; mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, prvHp[pretRefs(tid0)]))(tid)) ∧ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid0; mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr))(tid), pcf(tid0; ready)(tid)) = apcf(tid0; ready)(tid))) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .qrl = qrl; (s)

Proof step 35 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid)), (tid0 = tid ⊃ mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)]);alsf(tid))) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid))) ≠ (tid0 = tid ⊃ ready;apcf(tid)) ⊦

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: tid0 = tid

Additional information

Used formulas: tid0 = tid

Proof step 36 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), tid0 = tid, vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid)), (tid0 = tid ⊃ mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)]);alsf(tid))) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid))) ≠ (tid0 = tid ⊃ ready;apcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], alsf(tid) = mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, optval0), lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready, mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)])) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready) ≠ ready ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:abspc-def, seq:⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ), subst:[gs, ls, pc] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready

Proof step 38 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ abspc(gs, ls, pc) = (pc = idle ⊃ idle ;(pc = ready ⊃ ready ;(pc = crashed ⊃ crashed ;( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 ⊃ invEnq ;(pc = E10 ∨ pc = E11 ∨ pc = E12 ∨ pc = E4 ∨ pc = E13 ∨ pc = E17 ⊃ resEnq ;( pc = D1 ∨ pc = D2 ∨ pc = D3 ∨ pc = D4 ∨ pc = D5 ∨ pc = D6 ∧ ¬ ls.success ∨ pc = D7 ∨ pc = D8 ∨ pc = D9 ∨ pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14 ∨ pc = D16 ∨ pc = D17 ∨ pc = D18 ∨ pc = D19 ∨ pc = D20 ∧ (ls.success → gs.ps[ls.nxt].deqID = None) ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID = None ∨ pc = D25 ∨ pc = D26 ∨ pc = D27 ∨ pc = D28 ∨ pc = D29 ∨ pc = D30 ∨ pc = D31 ∨ pc = D32 ∨ pc = D33 ⊃ invDeq ;resDeq ) ) ) ) ) )

A spec-lemma

Proof step 39 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], alsf(tid) = mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, optval0), lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready, mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)])) ∨ (ready = idle ⊃ idle ;(ready = ready ⊃ ready ;(ready = crashed ⊃ crashed ;( ready = E1 ∨ ready = E2 ∨ ready = E3 ∨ ready = E4 ∧ ¬ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ ready = E5 ∨ ready = E6 ∨ ready = E7 ∨ ready = E8 ∨ ready = E9 ∨ ready = E10 ∧ ( mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null) ∨ ready = E11 ∧ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).lst ] .next = null ∨ ready = E13 ∨ ready = E14 ∨ ready = E15 ∨ ready = E16 ⊃ invEnq ;(ready = E10 ∨ ready = E11 ∨ ready = E12 ∨ ready = E4 ∨ ready = E13 ∨ ready = E17 ⊃ resEnq ;( ready = D1 ∨ ready = D2 ∨ ready = D3 ∨ ready = D4 ∨ ready = D5 ∨ ready = D6 ∧ ¬ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success ∨ ready = D7 ∨ ready = D8 ∨ ready = D9 ∨ ready = D10 ∨ ready = D11 ∨ ready = D12 ∨ ready = D13 ∨ ready = D14 ∨ ready = D16 ∨ ready = D17 ∨ ready = D18 ∨ ready = D19 ∨ ready = D20 ∧ ( mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).success → mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None) ∨ ready = D21 ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps [mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr).nxt ] .deqID = None ∨ ready = D25 ∨ ready = D26 ∨ ready = D27 ∨ ready = D28 ∨ ready = D29 ∨ ready = D30 ∨ ready = D31 ∨ ready = D32 ∨ ready = D33 ⊃ invDeq ;resDeq ) ) ) ) ) ) ≠ ready ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ idle ≠ ready; (s)

Proof step 40 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid)] = prvHp[pretRefs(tid)], alsf(tid) = mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, optval0), lsf(tid) = mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid) = D34, resDeq = apcf(tid), rvowns(pretRefs(tid)) = (prvHp[pretRefs(tid)] = Empty ⊃ Pending(tid);Claimed(tid, prvHp[pretRefs(tid)].val)), vretRefs(tid) = pretRefs(tid), pretRefs(tid) ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), noowns(tid, owns), pretRefs(tid) ∈ vrvHp, ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready, mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)])), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid) ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready, mkls (tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)])], <all paths>

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ E1 ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E4 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D34 ≠ ready; (s) Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), ready, mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)])

Proof step 41 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 42 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ¬ absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid)), (tid0 = tid ⊃ mkls(tid, obsEmpty0, val0, prvHp[pretRefs(tid)], val1, prvHp[pretRefs(tid)]);alsf(tid))) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), (tid0 = tid ⊃ mkls(tid, val, prvHp[pretRefs(tid)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr);lsf(tid)), (tid0 = tid ⊃ ready;pcf(tid))) ≠ (tid0 = tid ⊃ ready;apcf(tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 43 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ¬ absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∨ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)], <all paths>

Additional information

Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)

Proof step 44 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 45 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ¬ ( lsf(tid).tid = alsf(tid).tid ∧ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ lsf(tid).success ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ ( lsf(tid).success → lsf(tid).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps[lsf(tid).lst].next = null) ∨ pcf(tid) = E11 ∧ lsf(tid).lst = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vtail ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps[lsf(tid).lst].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → lsf(tid).value = alsf(tid).ival) ∧ ((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ lsf(tid).nxt = null → alsf(tid).obsEmpty) ∧ ( pcf(tid) = D20 ∧ lsf(tid).success ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D21 ∧ mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D22 → alsf(tid).oval = lsf(tid).optval) ∧ ( pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ lsf(tid).success ∨ pcf(tid) = D34 → alsf(tid).oval = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vrvHp [mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns).vretRefs(lsf(tid).tid) ])) ∨ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s)

Proof step 46 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), lsf(tid).tid ≠ alsf(tid).tid ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ lsf(tid).success ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (lsf(tid).success → lsf(tid).lst = vtail ∧ ps[lsf(tid).lst].next = null) ∨ pcf(tid) = E11 ∧ lsf(tid).lst = vtail ∧ ps[lsf(tid).lst].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → lsf(tid).value = alsf(tid).ival) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ lsf(tid).nxt = null → alsf(tid).obsEmpty) ∨ ¬ ( pcf(tid) = D20 ∧ lsf(tid).success ∧ ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D22 → alsf(tid).oval = lsf(tid).optval) ∨ ¬ ( pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ lsf(tid).success ∨ pcf(tid) = D34 → alsf(tid).oval = vrvHp[vretRefs(lsf(tid).tid)]) ∨ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DQ, name:elim-mkls, seq:⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval), subst:[value, ival, obsEmpty, ls, oval, tid, optval] → [val3, val2, obsEmpty1, alsf(tid), optval, tid1, optval2]

Additional information

Used simplifier rules: ⊦ ( ( ((tid = ls.tid ∧ (obsEmpty ↔ ls.obsEmpty)) ∧ ival = ls.ival) ∧ oval = ls.oval) ∧ value = ls.value) ∧ optval = ls.optval ↔ ls = mkls(tid, obsEmpty, ival, oval, value, optval); (elim) Used terms: value, ival, obsEmpty1, alsf(tid), oval, tid1, optval

Proof step 47 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), alsf(tid) = mkls(tid1, obsEmpty1, val2, optval, val3, optval2), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), lsf(tid).tid ≠ tid1 ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ lsf(tid).success ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (lsf(tid).success → lsf(tid).lst = vtail ∧ ps[lsf(tid).lst].next = null) ∨ pcf(tid) = E11 ∧ lsf(tid).lst = vtail ∧ ps[lsf(tid).lst].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → lsf(tid).value = val2) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ lsf(tid).nxt = null → obsEmpty1) ∨ ¬ ( pcf(tid) = D20 ∧ lsf(tid).success ∧ ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[lsf(tid).nxt].deqID ≠ None ∨ pcf(tid) = D22 → optval = lsf(tid).optval) ∨ ¬(pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ lsf(tid).success ∨ pcf(tid) = D34 → optval = vrvHp[vretRefs(lsf(tid).tid)]) ∨ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [val4, vhead2, optval4, vhead0, nd0, lsf(tid), addr0, tid3, vhead1, vhead3, rvref0, tid4, obsEmpty2, optval3]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval3, node, nd0, lsf(tid), addr0, tid3, lst, first, rvref0, othertid, success, optval3

Proof step 48 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid) = mkls(tid1, obsEmpty1, val2, optval, val3, optval2), alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), lsf(tid) = mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), tid3 ≠ tid1 ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ obsEmpty2 ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (obsEmpty2 → vhead1 = vtail ∧ ps[vhead1].next = null) ∨ pcf(tid) = E11 ∧ vhead1 = vtail ∧ ps[vhead1].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → val4 = val2) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ vhead2 = null → obsEmpty1) ∨ ¬(pcf(tid) = D20 ∧ obsEmpty2 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D22 → optval = optval3) ∨ ¬(pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ obsEmpty2 ∨ pcf(tid) = D34 → optval = vrvHp[vretRefs(tid3)]) ∨ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 49 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], alsf(tid) = mkls(tid1, obsEmpty1, val2, optval, val3, optval2), alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), lsf(tid) = mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), ∀ tid. absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)) ∧ abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), tid3 ≠ tid1 ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ obsEmpty2 ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (obsEmpty2 → vhead1 = vtail ∧ ps[vtail].next = null) ∨ pcf(tid) = E11 ∧ vhead1 = vtail ∧ ps[vtail].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → val4 = val2) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ vhead2 = null → obsEmpty1) ∨ ¬(pcf(tid) = D20 ∧ obsEmpty2 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D22 → optval = optval3) ∨ ¬(pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ obsEmpty2 ∨ pcf(tid) = D34 → optval = vrvHp[vretRefs(tid1)]) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid)) ≠ apcf(tid) ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: tid

Proof step 50 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], abspc(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) = apcf(tid), alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), alsf(tid) = mkls(tid1, obsEmpty1, val2, optval, val3, optval2), lsf(tid) = mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), absls(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid), alsf(tid)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), tid3 ≠ tid1 ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ obsEmpty2 ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (obsEmpty2 → vhead1 = vtail ∧ ps[vtail].next = null) ∨ pcf(tid) = E11 ∧ vhead1 = vtail ∧ ps[vtail].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → val4 = val2) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ vhead2 = null → obsEmpty1) ∨ ¬(pcf(tid) = D20 ∧ obsEmpty2 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D22 → optval = optval3) ∨ ¬(pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ obsEmpty2 ∨ pcf(tid) = D34 → optval = vrvHp[vretRefs(tid1)]) ∨ abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid1, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid)) ≠ apcf(tid) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 51 from proof fwsim-step-retdeq (previous step) (back to tree)

vrvHp[pretRefs(tid0)] = prvHp[pretRefs(tid0)], abspc (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid)) = apcf(tid), alsf(tid0) = mkls(tid0, obsEmpty0, val0, prvHp[pretRefs(tid0)], val1, optval0), alsf(tid) = mkls(tid1, obsEmpty1, val2, optval, val3, optval2), lsf(tid) = mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), lsf(tid0) = mkls(tid0, val, prvHp[pretRefs(tid0)], vtail0, nd, obsEmpty, vtail1, vtail2, rvref, optval1, vtail3, tid2, addr), pcf(tid0) = D34, resDeq = apcf(tid0), rvowns(pretRefs(tid0)) = (prvHp[pretRefs(tid0)] = Empty ⊃ Pending(tid0);Claimed(tid0, prvHp[pretRefs(tid0)].val)), vretRefs(tid0) = pretRefs(tid0), pretRefs(tid0) ≠ null, tid0 ≠ tid, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), absls (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid), mkls(tid1, obsEmpty1, val2, optval, val3, optval2)), nextnottid(tid0, vhead, vs), noid(tid0, orl + qrl, vhead, vs), noowns(tid0, owns), pretRefs(tid0) ∈ vrvHp, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)), tid3 ≠ tid1 ∨ ¬ ( pcf(tid) = E1 ∨ pcf(tid) = E2 ∨ pcf(tid) = E3 ∨ pcf(tid) = E4 ∧ ¬ obsEmpty2 ∨ pcf(tid) = E5 ∨ pcf(tid) = E6 ∨ pcf(tid) = E7 ∨ pcf(tid) = E8 ∨ pcf(tid) = E9 ∨ pcf(tid) = E10 ∧ (obsEmpty2 → vhead1 = vtail ∧ ps[vtail].next = null) ∨ pcf(tid) = E11 ∧ vhead1 = vtail ∧ ps[vtail].next = null ∨ pcf(tid) = E13 ∨ pcf(tid) = E14 ∨ pcf(tid) = E15 ∨ pcf(tid) = E16 → val4 = val2) ∨ ¬((pcf(tid) = D10 ∨ pcf(tid) = D11 ∨ pcf(tid) = D12 ∨ pcf(tid) = D13 ∨ pcf(tid) = D14) ∧ vhead2 = null → obsEmpty1) ∨ ¬(pcf(tid) = D20 ∧ obsEmpty2 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D21 ∧ ps[vhead2].deqID ≠ None ∨ pcf(tid) = D22 → optval = optval3) ∨ ¬(pcf(tid) = D15 ∨ pcf(tid) = D23 ∨ pcf(tid) = D24 ∨ pcf(tid) = D6 ∧ obsEmpty2 ∨ pcf(tid) = D34 → optval = vrvHp[vretRefs(tid1)]) ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: abs, name:absls-def, seq:⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ( (pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ ( pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ ( pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)]), subst:[gs, ls, pc, als] → [mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid), mkls(tid1, obsEmpty1, val2, optval, val3, optval2)], <all paths>

Additional information

Used simplifier rules: ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vretRefs = vretRefs; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).oval = oval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval = optval; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .nxt = node1; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).obsEmpty ↔ obsEmpty; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success ↔ success; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail = phead1; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .ps = ps; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .lst = node0; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .value = value; (s) ⊦ mkls(tid, obsEmpty, ival, oval, ival0, oval0).ival = ival; (s) Used terms: mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls (tid3, val4, optval3, vhead0, nd0, obsEmpty2, vhead1, vhead2, rvref0, optval4, vhead3, tid4, addr0), pcf(tid), mkls(tid1, obsEmpty1, val2, optval, val3, optval2)

Proof step 52 from proof fwsim-step-retdeq (previous step) (back to tree)

⊦ absls(gs, ls, pc, als) ↔ ls.tid = als.tid ∧ ( pc = E1 ∨ pc = E2 ∨ pc = E3 ∨ pc = E4 ∧ ¬ ls.success ∨ pc = E5 ∨ pc = E6 ∨ pc = E7 ∨ pc = E8 ∨ pc = E9 ∨ pc = E10 ∧ (ls.success → ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null) ∨ pc = E11 ∧ ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∨ pc = E13 ∨ pc = E14 ∨ pc = E15 ∨ pc = E16 → ls.value = als.ival) ∧ ((pc = D10 ∨ pc = D11 ∨ pc = D12 ∨ pc = D13 ∨ pc = D14) ∧ ls.nxt = null → als.obsEmpty) ∧ (pc = D20 ∧ ls.success ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D21 ∧ gs.ps[ls.nxt].deqID ≠ None ∨ pc = D22 → als.oval = ls.optval) ∧ (pc = D15 ∨ pc = D23 ∨ pc = D24 ∨ pc = D6 ∧ ls.success ∨ pc = D34 → als.oval = gs.vrvHp[gs.vretRefs(ls.tid)])

A spec-lemma

Proof step 53 from proof fwsim-step-retdeq (previous step) (back to tree)

gs0 = mkgs (ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), orl, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns), rvowns), lsf0 = lsf, pcf0 = pcf, retDEQ(tid, optval) = (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ doEnq(owns(vs[(orl + qrl).last].next).tid);τ), vtail0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vtail0 ∈ vs, vtail0 ∈ ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 54 from proof fwsim-step-retdeq (previous step) (back to tree)

retDEQ(tid, optval) = (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ doEnq(owns(vs[(orl + qrl).last].next).tid);τ), vtail0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vtail0 ∈ ps, vtail0 ∈ vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs (ps[vtail0, ps[vtail0].next:= vs[vtail0].next], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ qrl + vs[(orl + qrl).last].next ';qrl), orl, (vtail0 = (orl + qrl).last ∧ vs[(orl + qrl).last].next ≠ null ⊃ owns(vs[(orl + qrl).last].next; None);owns), rvowns), lsf, pcf), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retDEQ(tid, optval) ≠ τ; (s) ⊦ doEnq(tid) ≠ retDEQ(tid0, optval); (s)

Proof step 55 from proof fwsim-step-retdeq (previous step) (back to tree)

gs0 = mkgs (ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), owns, rvowns), lsf0 = lsf, pcf0 = pcf, retDEQ(tid, optval) = (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ doDeq(vs[qrl.head].deqID.tid);τ), vhead0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vhead0 ∈ vs, vhead0 ∈ ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate(gs0, lsf0, pcf0), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 56 from proof fwsim-step-retdeq (previous step) (back to tree)

retDEQ(tid, optval) = (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ doDeq(vs[qrl.head].deqID.tid);τ), vhead0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vhead0 ∈ ps, vhead0 ∈ vs, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs (ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ qrl.tail;qrl), (qrl ≠ [] ∧ vhead0 = qrl.head ∧ vs[qrl.head].deqID ≠ None ⊃ orl + qrl.head ';orl), owns, rvowns), lsf, pcf), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vtail0, orl0]

Additional information

Used simplifier rules: ⊦ retDEQ(tid, optval) ≠ τ; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail0, y

Proof step 57 from proof fwsim-step-retdeq (previous step) (back to tree)

qrl = vtail0 + orl0, retDEQ(tid, optval) = (qrl ≠ [] ∧ vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ doDeq(vs[vtail0].deqID.tid);τ), qrl ≠ [], vhead0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns)), abs(mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vhead0 ∈ vs, vhead0 ∈ ps, ∀ tid. lsf(tid).tid = tid ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), lsf(tid), pcf(tid)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs (ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (qrl ≠ [] ∧ vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ orl0;qrl), (qrl ≠ [] ∧ vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ orl + vtail0 ';orl), owns, rvowns), lsf, pcf), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

Heuristic simplifier 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 ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 58 from proof fwsim-step-retdeq (previous step) (back to tree)

retDEQ(tid, optval) = (vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ doDeq(vs[vtail0].deqID.tid);τ), vhead0 ≠ null, DMSQGInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns)), abs (mkstate(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf, pcf), mkstate(mkgs(q), alsf, apcf)), vhead0 ∈ ps, vhead0 ∈ vs, ∀ tid0. lsf(tid0).tid = tid0 ∧ DMSQLInv(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, vtail0 ' + orl0, orl, owns, rvowns), lsf(tid0), pcf(tid0)) ⊦ pre(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)) ∧ abs (mkstate (mkgs (ps[vhead0, ps[vhead0].deqID:= vs[vhead0].deqID], vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, (vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ orl0;vtail0 ' + orl0), (vhead0 = vtail0 ∧ vs[vtail0].deqID ≠ None ⊃ orl + vtail0 ';orl), owns, rvowns), lsf, pcf), mkstate (gstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)), alsf(tid; lstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval))), apcf(tid; pcstepf(mkgs(q), alsf(tid), apcf(tid), RetDeq(tid, optval)))))

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ retDEQ(tid, optval) ≠ τ; (s) ⊦ doDeq(tid) ≠ retDEQ(tid0, optval); (s)

Proof Tree for fwsim-step-retdeq (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