[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof copied-step-DMSQLInv (conclusion) (back to tree)

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

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

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

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

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] → [a, ls0, pc0, pc, gs0, ls, gs], <all paths>

Additional information

Used terms: a, ls0, pc0, pc, gs0, ls, gs

Proof step 3 from proof copied-step-DMSQLInv (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 4 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: pc

Additional information

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

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

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D1, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), DMSQGInv(gs), DMSQLInv(gs, ls, D1), pre(gs, ls, D1, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D1-D2, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D1, a) ∧ pcstepf(gs, ls, D1, a) = D2 → ( listp (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).ps, gstepf(gs, ls, D1, a).owns) ∧ ¬ dups(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).ps) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).vs) ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).ps) ∧ gstepf(gs, ls, D1, a).orl ≠ [] ∧ gstepf(gs, ls, D1, a).phead ∈ gstepf(gs, ls, D1, a).orl ∧ rvownerok (gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv (gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv (gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp) ∧ dom gstepf(gs, ls, D1, a).vrvHp = dom gstepf(gs, ls, D1, a).prvHp ∧ ( gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ≠ null ∧ gstepf(gs, ls, D1, a).vs [gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D1, a).rvowns (gstepf(gs, ls, D1, a).vretRefs (gstepf(gs, ls, D1, a).vs [gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D1, a).vs [gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D1, a).vs [gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D1, a).orl.last = gstepf(gs, ls, D1, a).vhead ∧ ( gstepf(gs, ls, D1, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D1, a).qrl.tail, gstepf(gs, ls, D1, a).vs)) ∨ gstepf(gs, ls, D1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D1, a).orl.butlast.last = gstepf(gs, ls, D1, a).vhead ∧ gstepf(gs, ls, D1, a).phead ≠ gstepf(gs, ls, D1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs)) ∧ ( gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last ∨ gstepf(gs, ls, D1, a).qrl ≠ [] ∧ gstepf(gs, ls, D1, a).vtail = ( gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl.butlast ).last ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D1, a).vs [(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noid (lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noowns(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D1, a) ∧ pcstepf(gs, ls, D1, a) = D2 → ( listp(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).ps, gstepf(gs, ls, D1, a).owns) ∧ ¬ dups(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).ps) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).vs) ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).ps) ∧ gstepf(gs, ls, D1, a).orl ≠ [] ∧ gstepf(gs, ls, D1, a).phead ∈ gstepf(gs, ls, D1, a).orl ∧ rvownerok(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp) ∧ dom gstepf(gs, ls, D1, a).vrvHp = dom gstepf(gs, ls, D1, a).prvHp ∧ ( gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ≠ null ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D1, a).rvowns (gstepf(gs, ls, D1, a).vretRefs(gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid, gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D1, a).orl.last = gstepf(gs, ls, D1, a).vhead ∧ (gstepf(gs, ls, D1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D1, a).qrl.tail, gstepf(gs, ls, D1, a).vs)) ∨ gstepf(gs, ls, D1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D1, a).orl.butlast.last = gstepf(gs, ls, D1, a).vhead ∧ gstepf(gs, ls, D1, a).phead ≠ gstepf(gs, ls, D1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs)) ∧ ( gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last ∨ gstepf(gs, ls, D1, a).qrl ≠ [] ∧ gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl.butlast).last ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D1, a).vs[(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noowns(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).owns)

Lemma step-D1-D2

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

gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), DMSQGInv(gs), DMSQLInv(gs, ls, D1), pre(gs, ls, D1, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D1, a) ∧ pcstepf(gs, ls, D1, a) = D2 → ( listp(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).ps, gstepf(gs, ls, D1, a).owns) ∧ ¬ dups(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).ps) ∧ markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).vs) ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).ps) ∧ gstepf(gs, ls, D1, a).orl ≠ [] ∧ gstepf(gs, ls, D1, a).phead ∈ gstepf(gs, ls, D1, a).orl ∧ rvownerok(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp, gstepf(gs, ls, D1, a).rvowns) ∧ allocrv(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp) ∧ dom gstepf(gs, ls, D1, a).vrvHp = dom gstepf(gs, ls, D1, a).prvHp ∧ ( gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ≠ null ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D1, a).rvowns (gstepf(gs, ls, D1, a).vretRefs(gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid, gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D1, a).orl.last = gstepf(gs, ls, D1, a).vhead ∧ (gstepf(gs, ls, D1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D1, a).qrl.tail, gstepf(gs, ls, D1, a).vs)) ∨ gstepf(gs, ls, D1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D1, a).orl.butlast.last = gstepf(gs, ls, D1, a).vhead ∧ gstepf(gs, ls, D1, a).phead ≠ gstepf(gs, ls, D1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs)) ∧ ( gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last ∨ gstepf(gs, ls, D1, a).qrl ≠ [] ∧ gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl.butlast).last ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D1, a).vs[(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs) ∧ noowns(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), DMSQGInv(gs), DMSQLInv(gs, ls, D1), pre(gs, ls, D1, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D1, a) ∧ pcstepf(gs, ls, D1, a) = D2

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), gs.orl ≠ [], DMSQLInv(gs, ls, D1), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D1, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D1, a) ∧ pcstepf(gs, ls, D1, a) = D2, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D1], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ crashed; (s) ⊦ D1 ≠ idle; (s) ⊦ D1 ≠ ready; (s) ⊦ D1 ≠ E1; (s) ⊦ D1 ≠ E17; (s) ⊦ D1 ≠ D7; (s) ⊦ D1 ≠ D32; (s) ⊦ D1 ≠ D33; (s) ⊦ D1 ≠ E4; (s) ⊦ D1 ≠ E16; (s) ⊦ D1 ≠ E15; (s) ⊦ D1 ≠ E14; (s) ⊦ D1 ≠ E13; (s) ⊦ D1 ≠ E12; (s) ⊦ D1 ≠ E11; (s) ⊦ D1 ≠ E10; (s) ⊦ D1 ≠ E9; (s) ⊦ D1 ≠ E8; (s) ⊦ D1 ≠ E7; (s) ⊦ D1 ≠ E6; (s) ⊦ D1 ≠ E5; (s) ⊦ D1 ≠ E3; (s) ⊦ D1 ≠ E2; (s) ⊦ D1 ≠ D34; (s) ⊦ D1 ≠ D31; (s) ⊦ D1 ≠ D30; (s) ⊦ D1 ≠ D29; (s) ⊦ D1 ≠ D28; (s) ⊦ D1 ≠ D27; (s) ⊦ D1 ≠ D26; (s) ⊦ D1 ≠ D25; (s) ⊦ D1 ≠ D24; (s) ⊦ D1 ≠ D23; (s) ⊦ D1 ≠ D22; (s) ⊦ D1 ≠ D21; (s) ⊦ D1 ≠ D20; (s) ⊦ D1 ≠ D19; (s) ⊦ D1 ≠ D18; (s) ⊦ D1 ≠ D17; (s) ⊦ D1 ≠ D16; (s) ⊦ D1 ≠ D15; (s) ⊦ D1 ≠ D14; (s) ⊦ D1 ≠ D13; (s) ⊦ D1 ≠ D12; (s) ⊦ D1 ≠ D11; (s) ⊦ D1 ≠ D10; (s) ⊦ D1 ≠ D9; (s) ⊦ D1 ≠ D8; (s) ⊦ D1 ≠ D6; (s) ⊦ D1 ≠ D5; (s) ⊦ D1 ≠ D4; (s) ⊦ D1 ≠ D3; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D1, a) = D2; (s) Used terms: gs, ls, D1

Proof step 12 from proof copied-step-DMSQLInv (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 13 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, D1, a).vrvHp = dom gstepf(gs, ls, D1, a).prvHp, gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), gstepf(gs, ls, D1, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D1), allocrv(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp), allocrv(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp), listp(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).ps, gstepf(gs, ls, D1, a).owns), markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).ps), markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).vs), nextnottid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs), noid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs), nonullRetRefs (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).pretRefs), noowns(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).owns), pre(gs, ls, D1, a), rvownerok(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp, gstepf(gs, ls, D1, a).rvowns), rvownerok(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp, gstepf(gs, ls, D1, a).rvowns), unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).ps), gstepf(gs, ls, D1, a).phead ∈ gstepf(gs, ls, D1, a).orl, ¬ dups(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl), gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ≠ null ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D1, a).rvowns (gstepf(gs, ls, D1, a).vretRefs(gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid, gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].val), gstepf(gs, ls, D1, a).orl.last = gstepf(gs, ls, D1, a).vhead ∧ (gstepf(gs, ls, D1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D1, a).qrl.tail, gstepf(gs, ls, D1, a).vs)) ∨ gstepf(gs, ls, D1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D1, a).orl.butlast.last = gstepf(gs, ls, D1, a).vhead ∧ gstepf(gs, ls, D1, a).phead ≠ gstepf(gs, ls, D1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs), gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last ∨ gstepf(gs, ls, D1, a).qrl ≠ [] ∧ gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl.butlast).last ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D1, a).vs[(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

dom gstepf(gs, ls, D1, a).vrvHp = dom gstepf(gs, ls, D1, a).prvHp, gs0 = gstepf(gs, ls, D1, a), ls0 = lstepf(gs, ls, D1, a), pc0 = pcstepf(gs, ls, D1, a), gstepf(gs, ls, D1, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D1), allocrv(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp), allocrv(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp), listp(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).ps, gstepf(gs, ls, D1, a).owns), markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).vs), markedp(gstepf(gs, ls, D1, a).orl, gstepf(gs, ls, D1, a).ps), nextnottid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs), noid(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vhead, gstepf(gs, ls, D1, a).vs), nonullRetRefs (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs, gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).pretRefs), noowns(lstepf(gs, ls, D1, a).tid, gstepf(gs, ls, D1, a).owns), pre(gs, ls, D1, a), rvownerok(gstepf(gs, ls, D1, a).pretRefs, gstepf(gs, ls, D1, a).prvHp, gstepf(gs, ls, D1, a).rvowns), rvownerok(gstepf(gs, ls, D1, a).vretRefs, gstepf(gs, ls, D1, a).vrvHp, gstepf(gs, ls, D1, a).rvowns), unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).ps), gstepf(gs, ls, D1, a).phead ∈ gstepf(gs, ls, D1, a).orl, ¬ dups(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl), gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next ≠ null ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D1, a).rvowns (gstepf(gs, ls, D1, a).vretRefs(gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].deqID.tid, gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).vhead].next].val), gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last ∨ gstepf(gs, ls, D1, a).qrl ≠ [] ∧ gstepf(gs, ls, D1, a).vtail = (gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl.butlast).last ∧ gstepf(gs, ls, D1, a).vs[gstepf(gs, ls, D1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D1, a).vs[(gstepf(gs, ls, D1, a).orl + gstepf(gs, ls, D1, a).qrl).last].next = null, gstepf(gs, ls, D1, a).orl.last = gstepf(gs, ls, D1, a).vhead ∧ (gstepf(gs, ls, D1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D1, a).qrl.tail, gstepf(gs, ls, D1, a).vs)) ∨ gstepf(gs, ls, D1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D1, a).orl.butlast.last = gstepf(gs, ls, D1, a).vhead ∧ gstepf(gs, ls, D1, a).phead ≠ gstepf(gs, ls, D1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D1, a).qrl, gstepf(gs, ls, D1, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D1, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D1 ≠ D2; (s) ⊦ D2 ≠ D3; (s) ⊦ D2 ≠ D4; (s) ⊦ D2 ≠ D5; (s) ⊦ D2 ≠ D6; (s) ⊦ D2 ≠ D7; (s) ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D16; (s) ⊦ D2 ≠ D17; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ D20; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ D25; (s) ⊦ D2 ≠ D26; (s) ⊦ D2 ≠ D27; (s) ⊦ D2 ≠ D28; (s) ⊦ D2 ≠ D29; (s) ⊦ D2 ≠ D30; (s) ⊦ D2 ≠ D31; (s) ⊦ D2 ≠ D32; (s) ⊦ D2 ≠ D33; (s) ⊦ D2 ≠ D34; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E17; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E11; (s) ⊦ pcstepf(gs, ls, D1, a) = D2; (s) ⊦ D2 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D1, τ) = gs; (s) ⊦ lstepf(gs, ls, D1, τ) = ls.optval:= Empty; (s) ⊦ (ls.optval:= optval).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 16 from proof copied-step-DMSQLInv (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 17 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D2, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = pcstepf(gs, ls, D2, a), DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D2, seq:⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2)

A spec-lemma

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), pc0 = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D2-D3, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok (gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv (gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv (gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs (gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ ( gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = ( gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast ).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D2, a).vs [(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid (lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns)

Lemma step-D2-D3

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3 → ( gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid) ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp ∧ lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp ∧ lstepf(gs, ls, D2, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], DMSQLInv(gs, ls, D2), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D2], <all paths>

Additional information

Used terms: gs, ls, D2

Proof step 27 from proof copied-step-DMSQLInv (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 28 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, D2 = 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, D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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)), D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = 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), D2 = 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), D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = 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) ), D2 = 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), D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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], D2 = 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], D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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), D2 = 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), D2 = 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), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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)), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = 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, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E4 ∨ D2 = 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], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = 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) ), D2 = 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)), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D3

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ chooseD2(rvref, optval) = chooseD2(rvref0, optval0) ↔ rvref = rvref0 ∧ optval = optval0; (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D2 ≠ D3; (s) ⊦ D2 ≠ D4; (s) ⊦ D2 ≠ D34; (s) ⊦ D2 ≠ D5; (s) ⊦ D2 ≠ D6; (s) ⊦ D2 ≠ D7; (s) ⊦ D2 ≠ D16; (s) ⊦ D2 ≠ D17; (s) ⊦ D2 ≠ D25; (s) ⊦ D2 ≠ D26; (s) ⊦ D2 ≠ D31; (s) ⊦ D2 ≠ D32; (s) ⊦ D2 ≠ D33; (s) ⊦ D2 ≠ D27; (s) ⊦ D2 ≠ D28; (s) ⊦ D2 ≠ D29; (s) ⊦ D2 ≠ D30; (s) ⊦ D2 ≠ D20; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E17; (s) ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ ready; (s) ⊦ D1 ≠ D2; (s)

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], pcstepf(gs, ls, D2, a) ≠ D3, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), D2 = 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)), D2 = 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) ), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E4 ∨ D2 = 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], D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = 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, D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = 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, D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = 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)), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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), D2 = 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), D2 = 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), D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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], D2 = 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], D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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), D2 = 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) ), D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = 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), D2 = 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), D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = 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)), D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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, D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D2, seq:⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2)

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, D2 = 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, D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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)), D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = 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), D2 = 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), D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = 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) ), D2 = 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), D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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], D2 = 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], D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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), D2 = 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), D2 = 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), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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)), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = 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, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E4 ∨ D2 = 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], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = 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) ), D2 = 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)), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2) = D3, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], D2 ≠ D3, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), D2 = 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)), D2 = 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) ), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E4 ∨ D2 = 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], D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = 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, D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = 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, D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = 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)), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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), D2 = 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), D2 = 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), D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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], D2 = 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], D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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), D2 = 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) ), D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = 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), D2 = 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), D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = 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)), D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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, D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 87

Additional information

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

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gs.orl ≠ [], D2 ≠ D3, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, D2 = 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, D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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)), D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = 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), D2 = 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), D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = 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) ), D2 = 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), D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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], D2 = 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], D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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), D2 = 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), D2 = 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), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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)), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = 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, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E4 ∨ D2 = 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], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = 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) ), D2 = 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)), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule all left

And closed the goal!

Rule argument

pos: left 87 terms: rvref0, optval00 abort: F discard: T computed: T

Additional information

Used terms: rvref0, optval00

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

gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid), dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gstepf(gs, ls, D2, a).orl ≠ [], lstepf(gs, ls, D2, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp), listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs), nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs), noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), pre(gs, ls, D2, a), rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns), rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns), unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps), lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp, lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl, ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl), gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs), gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D2, a).rvowns(lstepf(gs, ls, D2, a).rvref) = Pending(lstepf(gs, ls, D2, a).tid), dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D3, gstepf(gs, ls, D2, a).orl ≠ [], lstepf(gs, ls, D2, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D2), allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp), allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps), nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs), noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), pre(gs, ls, D2, a), rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns), rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns), unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps), gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl, lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).prvHp, lstepf(gs, ls, D2, a).rvref ∈ gstepf(gs, ls, D2, a).vrvHp, ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl), gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val), ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null, gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ Pending(tid) = Pending(tid0) ↔ tid = tid0; (s) ⊦ a ∈ st[a, d]; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ chooseD2(rvref, optval) = chooseD2(rvref0, optval0) ↔ rvref = rvref0 ∧ optval = optval0; (ws) ⊦ lstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = (ls.rvref:= rvref0).optval0:= optval00; (s) ⊦ (gs.rvowns:= rvowns).vtail = gs.vtail; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ (gs.vrvHp:= vrvHp).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.rvowns:= rvowns).owns = gs.owns; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ (gs.vrvHp:= vrvHp).owns = gs.owns; (s) ⊦ (gs.rvowns:= rvowns).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ (gs.rvowns:= rvowns).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.rvowns:= rvowns).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.rvowns:= rvowns).prvHp = gs.prvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ (gs.rvowns:= rvowns).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.rvowns:= rvowns).rvowns = rvowns; (s) ⊦ (gs.rvowns:= rvowns).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.vrvHp:= vrvHp).qrl = gs.qrl; (s) ⊦ (gs.rvowns:= rvowns).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ (gs.rvowns:= rvowns).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ (gs.rvowns:= rvowns).vhead = gs.vhead; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ (gs.vrvHp:= vrvHp).vhead = gs.vhead; (s) ⊦ (gs.rvowns:= rvowns).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.vrvHp:= vrvHp).phead = gs.phead; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 37 from proof copied-step-DMSQLInv (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 38 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D2-D2, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2 → ( listp (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok (gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv (gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv (gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs (gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D2, a).vs [gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ ( gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = ( gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast ).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D2, a).vs [(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid (lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2 → ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns)

Lemma step-D2-D2

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2 → ( listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps) ∧ markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs) ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps) ∧ gstepf(gs, ls, D2, a).orl ≠ [] ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl ∧ rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns) ∧ allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp) ∧ dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp ∧ ( gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs)) ∧ ( gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, DMSQGInv(gs), DMSQLInv(gs, ls, D2), pre(gs, ls, D2, a), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, gs.orl ≠ [], DMSQLInv(gs, ls, D2), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D2], <all paths>

Additional information

Used terms: gs, ls, D2

Proof step 44 from proof copied-step-DMSQLInv (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 45 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D2, a), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), D2 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, D2 = 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, D2 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = 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)), D2 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, D2 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = 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), D2 = 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), D2 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), D2 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, D2 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, D2 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, D2 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = 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) ), D2 = 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), D2 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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], D2 = 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], D2 = 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)), D2 = 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)), D2 = 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)), D2 = 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), D2 = 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), D2 = 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), D2 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, D2 = 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)), D2 = E2 → gs.owns(ls.node) = Some(ls.tid), D2 = E3 → gs.owns(ls.node) = Some(ls.tid), D2 = E5 → gs.owns(ls.node) = Some(ls.tid), D2 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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), D2 = 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, D2 = E13 → gs.owns(ls.node) = Some(ls.tid), D2 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, D2 = 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, D2 = E16 → gs.owns(ls.node) = Some(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, D2 = E4 ∨ D2 = 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], D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → gs.ps[ls.node] = gs.vs[ls.node], D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = D13 ∨ D2 = D14 ∨ D2 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → ¬ ls.success, D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = 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), D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = E1 ∨ D2 = E2 ∨ D2 = E3 ∨ D2 = E4 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E10 ∨ D2 = E11 ∨ D2 = E12 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 ∨ D2 = E17 ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D18 ∨ D2 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), D2 = D22 ∨ D2 = D23 ∨ D2 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), D2 = crashed ∨ D2 = idle ∨ D2 = ready ∨ D2 = D1 ∨ D2 = D2 ∨ D2 = D3 ∨ D2 = D4 ∨ D2 = D5 ∨ D2 = D6 ∨ D2 = D7 ∨ D2 = D8 ∨ D2 = D9 ∨ D2 = D10 ∨ D2 = D11 ∨ D2 = D12 ∨ D2 = D13 ∨ D2 = D14 ∨ D2 = D15 ∨ D2 = D16 ∨ D2 = D17 ∨ D2 = D18 ∨ D2 = D19 ∨ D2 = D20 ∨ D2 = D21 ∨ D2 = D22 ∨ D2 = D23 ∨ D2 = D24 ∨ D2 = D25 ∨ D2 = D26 ∨ D2 = D27 ∨ D2 = D28 ∨ D2 = D29 ∨ D2 = D30 ∨ D2 = D31 ∨ D2 = D32 ∨ D2 = D33 ∨ D2 = D34 ∨ D2 = E1 ∨ D2 = E12 ∨ D2 = E17 → noowns(ls.tid, gs.owns), D2 = E2 ∨ D2 = E3 ∨ D2 = E5 ∨ D2 = E6 ∨ D2 = E7 ∨ D2 = E8 ∨ D2 = E9 ∨ D2 = E13 ∨ D2 = E14 ∨ D2 = E15 ∨ D2 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), D2 = 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) ), D2 = 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)), D2 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D2, a) ∧ pcstepf(gs, ls, D2, a) = D2

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ D2 ≠ D3; (s) ⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2); (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D2 ≠ D4; (s) ⊦ D2 ≠ D5; (s) ⊦ D2 ≠ D6; (s) ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D16; (s) ⊦ D2 ≠ D17; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ D20; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ D25; (s) ⊦ D2 ≠ D26; (s) ⊦ D2 ≠ D27; (s) ⊦ D2 ≠ D28; (s) ⊦ D2 ≠ D29; (s) ⊦ D2 ≠ D30; (s) ⊦ D2 ≠ D31; (s) ⊦ D2 ≠ D34; (s) ⊦ D2 ≠ E2; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ D33; (s) ⊦ D2 ≠ D32; (s) ⊦ D2 ≠ D7; (s) ⊦ D1 ≠ D2; (s) ⊦ D2 ≠ E17; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ ready; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ crashed; (s)

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

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gstepf(gs, ls, D2, a)) ∧ DMSQLInv(gstepf(gs, ls, D2, a), lstepf(gs, ls, D2, a), D2) ∧ ls.tid = lstepf(gs, ls, D2, a).tid, ( (∃ rvref, optval. ¬ rvref ∈ gs.vrvHp ∧ ¬ rvref ∈ gs.prvHp ∧ rvref ≠ null ∧ a = chooseD2(rvref, optval)) ∨ a = τ ∧ (rvref ∈ gs.vrvHp ∨ rvref ∈ gs.prvHp ∨ rvref = null)) ∧ a ≠ chooseD2(rvref1, optval)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 23

Additional information

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

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref0 ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ( (∃ rvref, optval. ¬ rvref ∈ gs.vrvHp ∧ ¬ rvref ∈ gs.prvHp ∧ rvref ≠ null ∧ a = chooseD2(rvref, optval)) ∨ a = τ ∧ (rvref ∈ gs.vrvHp ∨ rvref ∈ gs.prvHp ∨ rvref = null)) ∧ a ≠ chooseD2(rvref1, optval), DMSQGInv(gstepf(gs, ls, D2, a)) ∧ DMSQLInv(gstepf(gs, ls, D2, a), lstepf(gs, ls, D2, a), D2) ∧ ls.tid = lstepf(gs, ls, D2, a).tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

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

a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref0 ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ ∃ rvref, optval. ¬ rvref ∈ gs.vrvHp ∧ ¬ rvref ∈ gs.prvHp ∧ rvref ≠ null ∧ a = chooseD2(rvref, optval), DMSQGInv(gstepf(gs, ls, D2, a)) ∧ DMSQLInv(gstepf(gs, ls, D2, a), lstepf(gs, ls, D2, a), D2) ∧ ls.tid = lstepf(gs, ls, D2, a).tid, a = τ ∧ (rvref ∈ gs.vrvHp ∨ rvref ∈ gs.prvHp ∨ rvref = null)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: rvref0, optval00 abort: F discard: T computed: T

Additional information

Used terms: rvref0, optval00

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

a = chooseD2(rvref1, optval), a = chooseD2(rvref0, optval00), dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref0 ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ rvref0 ∈ gs.prvHp, ¬ rvref0 ∈ gs.vrvHp, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gstepf(gs, ls, D2, a)) ∧ DMSQLInv(gstepf(gs, ls, D2, a), lstepf(gs, ls, D2, a), D2) ∧ ls.tid = lstepf(gs, ls, D2, a).tid

User applied rule all left

And closed the goal!

Rule argument

pos: left 27 terms: rvref0, optval00 abort: F discard: T computed: T

Additional information

Used terms: rvref0, optval00

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

a = τ, dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ∃ rvref0. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null, ( (∃ rvref, optval. ¬ rvref ∈ gs.vrvHp ∧ ¬ rvref ∈ gs.prvHp ∧ rvref ≠ null ∧ a = chooseD2(rvref, optval)) ∨ a = τ ∧ (rvref ∈ gs.vrvHp ∨ rvref ∈ gs.prvHp ∨ rvref = null)) ∧ a ≠ chooseD2(rvref1, optval), DMSQGInv(gstepf(gs, ls, D2, a)) ∧ DMSQLInv(gstepf(gs, ls, D2, a), lstepf(gs, ls, D2, a), D2) ∧ ls.tid = lstepf(gs, ls, D2, a).tid

User applied rule exists right

And closed the goal!

Rule argument

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

Additional information

Used simplifier rules: ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ gstepf(gs, ls, D2, τ) = gs; (s) ⊦ lstepf(gs, ls, D2, τ) = ls; (s) Used terms: rvref

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

dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, gstepf(gs, ls, D2, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D2), allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp), listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs), nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs), noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), pre(gs, ls, D2, a), rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns), rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns), unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps), gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl, ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl), gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs), gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp, gs0 = gstepf(gs, ls, D2, a), ls0 = lstepf(gs, ls, D2, a), pc0 = D2, gstepf(gs, ls, D2, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D2), allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp), allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps), nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs), noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), pre(gs, ls, D2, a), rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns), rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns), unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps), gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl, ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl), gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last].next = null, gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used terms: gs0, ls0, pc0

Proof step 54 from proof copied-step-DMSQLInv (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 55 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ D2 ≠ E4; (s) ⊦ D2 ≠ E11; (s) ⊦ D2 ≠ E10; (s) ⊦ D2 ≠ E16; (s) ⊦ D2 ≠ E15; (s) ⊦ D2 ≠ E14; (s) ⊦ D2 ≠ E13; (s) ⊦ D2 ≠ E9; (s) ⊦ D2 ≠ E8; (s) ⊦ D2 ≠ E7; (s) ⊦ D2 ≠ E6; (s) ⊦ D2 ≠ E5; (s) ⊦ D2 ≠ E3; (s) ⊦ D2 ≠ E2; (s) ⊦ D1 ≠ D2; (s) ⊦ D2 ≠ ready; (s) ⊦ D2 ≠ idle; (s) ⊦ D2 ≠ crashed; (s) ⊦ D2 ≠ D24; (s) ⊦ D2 ≠ D23; (s) ⊦ D2 ≠ D22; (s) ⊦ D2 ≠ D19; (s) ⊦ D2 ≠ D18; (s) ⊦ D2 ≠ D15; (s) ⊦ D2 ≠ D14; (s) ⊦ D2 ≠ D13; (s) ⊦ D2 ≠ D12; (s) ⊦ D2 ≠ D11; (s) ⊦ D2 ≠ D10; (s) ⊦ D2 ≠ D9; (s) ⊦ D2 ≠ D8; (s) ⊦ D2 ≠ E17; (s) ⊦ D2 ≠ E12; (s) ⊦ D2 ≠ E1; (s) ⊦ D2 ≠ D21; (s) ⊦ D2 ≠ D20; (s) ⊦ D2 ≠ D30; (s) ⊦ D2 ≠ D29; (s) ⊦ D2 ≠ D28; (s) ⊦ D2 ≠ D27; (s) ⊦ D2 ≠ D33; (s) ⊦ D2 ≠ D32; (s) ⊦ D2 ≠ D31; (s) ⊦ D2 ≠ D26; (s) ⊦ D2 ≠ D25; (s) ⊦ D2 ≠ D17; (s) ⊦ D2 ≠ D16; (s) ⊦ D2 ≠ D7; (s) ⊦ D2 ≠ D6; (s) ⊦ D2 ≠ D5; (s) ⊦ D2 ≠ D34; (s) ⊦ D2 ≠ D4; (s) ⊦ D2 ≠ D3; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s)

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

dom gstepf(gs, ls, D2, a).vrvHp = dom gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).orl ≠ [], ls.tid ≠ lstepf(gs, ls, D2, a).tid, DMSQGInv(gs), DMSQLInv(gs, ls, D2), allocrv(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp), allocrv(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp), listp(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).vs), markedp(gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).ps), nextnottid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), noid(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs), nonullRetRefs (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).pretRefs), noowns(lstepf(gs, ls, D2, a).tid, gstepf(gs, ls, D2, a).owns), rvownerok(gstepf(gs, ls, D2, a).pretRefs, gstepf(gs, ls, D2, a).prvHp, gstepf(gs, ls, D2, a).rvowns), rvownerok(gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp, gstepf(gs, ls, D2, a).rvowns), unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).ps), gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl, gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).ps, ¬ dups(gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl), ¬ dups(gstepf(gs, ls, D2, a).orl), ¬ dups(gstepf(gs, ls, D2, a).qrl), gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next ≠ null ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D2, a).rvowns (gstepf(gs, ls, D2, a).vretRefs(gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].deqID.tid, gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).vhead].next].val), ∀ rvref0, optval00. a ≠ chooseD2(rvref0, optval00), gstepf(gs, ls, D2, a).orl.last = gstepf(gs, ls, D2, a).vhead ∧ (gstepf(gs, ls, D2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D2, a).qrl.tail, gstepf(gs, ls, D2, a).vs)) ∨ gstepf(gs, ls, D2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D2, a).orl.butlast.last = gstepf(gs, ls, D2, a).vhead ∧ gstepf(gs, ls, D2, a).phead ≠ gstepf(gs, ls, D2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs), ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null), gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl).last ∨ gstepf(gs, ls, D2, a).qrl ≠ [] ∧ gstepf(gs, ls, D2, a).vtail = (gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl.butlast).last ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D2, a).vs[gstepf(gs, ls, D2, a).qrl.last].next = null ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 27

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, D2, τ) = gs; (s) ⊦ lstepf(gs, ls, D2, τ) = ls; (s) ⊦ (gs.rvowns:= rvowns).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ (gs.rvowns:= rvowns).prvHp = gs.prvHp; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s) ⊦ (ls.optval0:= optval0).optval0 = optval0; (s) ⊦ (ls.optval0:= optval0).rvref = ls.rvref; (s) ⊦ (ls.rvref:= rvref).rvref = rvref; (s) ⊦ (gs.rvowns:= rvowns).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.vrvHp:= vrvHp).orl = gs.orl; (s) ⊦ lstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = (ls.rvref:= rvref0).optval0:= optval00; (s) ⊦ (ls.optval0:= optval0).tid = ls.tid; (s) ⊦ (ls.rvref:= rvref).tid = ls.tid; (s)

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

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D3, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = pcstepf(gs, ls, D3, a), DMSQGInv(gs), DMSQLInv(gs, ls, D3), pre(gs, ls, D3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D3, seq: ⊦ pcstepf(gs, ls, D3, a) = D4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D3, a) = D4

A spec-lemma

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

gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, DMSQGInv(gs), DMSQLInv(gs, ls, D3), pre(gs, ls, D3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D3-D4, seq:⊦ ( ( gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → ( gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid) = lstepf(gs, ls, D3, a).rvref ∧ gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid)) = Pending(lstepf(gs, ls, D3, a).tid) ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).vrvHp ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).prvHp ∧ lstepf(gs, ls, D3, a).rvref ≠ null) ∧ ( listp (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ ¬ dups(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).ps) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).vs) ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).ps) ∧ gstepf(gs, ls, D3, a).orl ≠ [] ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl ∧ rvownerok (gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv (gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv (gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp) ∧ dom gstepf(gs, ls, D3, a).vrvHp = dom gstepf(gs, ls, D3, a).prvHp ∧ ( gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ≠ null ∧ gstepf(gs, ls, D3, a).vs [gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs (gstepf(gs, ls, D3, a).vs [gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D3, a).vs [gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D3, a).vs [gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D3, a).orl.last = gstepf(gs, ls, D3, a).vhead ∧ ( gstepf(gs, ls, D3, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D3, a).qrl.tail, gstepf(gs, ls, D3, a).vs)) ∨ gstepf(gs, ls, D3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D3, a).orl.butlast.last = gstepf(gs, ls, D3, a).vhead ∧ gstepf(gs, ls, D3, a).phead ≠ gstepf(gs, ls, D3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs)) ∧ ( gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last ∨ gstepf(gs, ls, D3, a).qrl ≠ [] ∧ gstepf(gs, ls, D3, a).vtail = ( gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl.butlast ).last ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D3, a).vs [(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noid (lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noowns(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → ( gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid) = lstepf(gs, ls, D3, a).rvref ∧ gstepf(gs, ls, D3, a).rvowns(gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid)) = Pending(lstepf(gs, ls, D3, a).tid) ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).vrvHp ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).prvHp ∧ lstepf(gs, ls, D3, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ ¬ dups(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).ps) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).vs) ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).ps) ∧ gstepf(gs, ls, D3, a).orl ≠ [] ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl ∧ rvownerok(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp) ∧ dom gstepf(gs, ls, D3, a).vrvHp = dom gstepf(gs, ls, D3, a).prvHp ∧ ( gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ≠ null ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs(gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid, gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D3, a).orl.last = gstepf(gs, ls, D3, a).vhead ∧ (gstepf(gs, ls, D3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D3, a).qrl.tail, gstepf(gs, ls, D3, a).vs)) ∨ gstepf(gs, ls, D3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D3, a).orl.butlast.last = gstepf(gs, ls, D3, a).vhead ∧ gstepf(gs, ls, D3, a).phead ≠ gstepf(gs, ls, D3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs)) ∧ ( gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last ∨ gstepf(gs, ls, D3, a).qrl ≠ [] ∧ gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl.butlast).last ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D3, a).vs[(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noowns(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).owns)

Lemma step-D3-D4

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

gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, DMSQGInv(gs), DMSQLInv(gs, ls, D3), pre(gs, ls, D3, a), ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4 → ( gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid) = lstepf(gs, ls, D3, a).rvref ∧ gstepf(gs, ls, D3, a).rvowns(gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid)) = Pending(lstepf(gs, ls, D3, a).tid) ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).vrvHp ∧ lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).prvHp ∧ lstepf(gs, ls, D3, a).rvref ≠ null) ∧ ( listp(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ ¬ dups(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).ps) ∧ markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).vs) ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).ps) ∧ gstepf(gs, ls, D3, a).orl ≠ [] ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl ∧ rvownerok(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).rvowns) ∧ allocrv(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp) ∧ dom gstepf(gs, ls, D3, a).vrvHp = dom gstepf(gs, ls, D3, a).prvHp ∧ ( gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ≠ null ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs(gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid, gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D3, a).orl.last = gstepf(gs, ls, D3, a).vhead ∧ (gstepf(gs, ls, D3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D3, a).qrl.tail, gstepf(gs, ls, D3, a).vs)) ∨ gstepf(gs, ls, D3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D3, a).orl.butlast.last = gstepf(gs, ls, D3, a).vhead ∧ gstepf(gs, ls, D3, a).phead ≠ gstepf(gs, ls, D3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs)) ∧ ( gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last ∨ gstepf(gs, ls, D3, a).qrl ≠ [] ∧ gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl.butlast).last ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D3, a).vs[(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ noowns(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, DMSQGInv(gs), DMSQLInv(gs, ls, D3), pre(gs, ls, D3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, gs.orl ≠ [], DMSQLInv(gs, ls, D3), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D3, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D3, a) ∧ pcstepf(gs, ls, D3, a) = D4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D3], <all paths>

Additional information

Used simplifier rules: ⊦ D3 ≠ crashed; (s) ⊦ D3 ≠ idle; (s) ⊦ D3 ≠ ready; (s) ⊦ D3 ≠ E1; (s) ⊦ D3 ≠ E17; (s) ⊦ D1 ≠ D3; (s) ⊦ D2 ≠ D3; (s) ⊦ D3 ≠ D7; (s) ⊦ D3 ≠ D32; (s) ⊦ D3 ≠ D33; (s) ⊦ D3 ≠ E4; (s) ⊦ D3 ≠ E16; (s) ⊦ D3 ≠ E15; (s) ⊦ D3 ≠ E14; (s) ⊦ D3 ≠ E13; (s) ⊦ D3 ≠ E12; (s) ⊦ D3 ≠ E11; (s) ⊦ D3 ≠ E10; (s) ⊦ D3 ≠ E9; (s) ⊦ D3 ≠ E8; (s) ⊦ D3 ≠ E7; (s) ⊦ D3 ≠ E6; (s) ⊦ D3 ≠ E5; (s) ⊦ D3 ≠ E3; (s) ⊦ D3 ≠ E2; (s) ⊦ D3 ≠ D34; (s) ⊦ D3 ≠ D31; (s) ⊦ D3 ≠ D30; (s) ⊦ D3 ≠ D29; (s) ⊦ D3 ≠ D28; (s) ⊦ D3 ≠ D27; (s) ⊦ D3 ≠ D26; (s) ⊦ D3 ≠ D25; (s) ⊦ D3 ≠ D24; (s) ⊦ D3 ≠ D23; (s) ⊦ D3 ≠ D22; (s) ⊦ D3 ≠ D21; (s) ⊦ D3 ≠ D20; (s) ⊦ D3 ≠ D19; (s) ⊦ D3 ≠ D18; (s) ⊦ D3 ≠ D17; (s) ⊦ D3 ≠ D16; (s) ⊦ D3 ≠ D15; (s) ⊦ D3 ≠ D14; (s) ⊦ D3 ≠ D13; (s) ⊦ D3 ≠ D12; (s) ⊦ D3 ≠ D11; (s) ⊦ D3 ≠ D10; (s) ⊦ D3 ≠ D9; (s) ⊦ D3 ≠ D8; (s) ⊦ D3 ≠ D6; (s) ⊦ D3 ≠ D5; (s) ⊦ D3 ≠ D4; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D3, a) = D4; (s) Used terms: gs, ls, D3

Proof step 66 from proof copied-step-DMSQLInv (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 67 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D3, a).rvowns(gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid)) = Pending(lstepf(gs, ls, D3, a).tid), gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid) = lstepf(gs, ls, D3, a).rvref, dom gstepf(gs, ls, D3, a).vrvHp = dom gstepf(gs, ls, D3, a).prvHp, gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, gstepf(gs, ls, D3, a).orl ≠ [], lstepf(gs, ls, D3, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D3), allocrv(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp), allocrv(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp), listp(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns), markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).ps), markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).vs), nextnottid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs), noid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs), nonullRetRefs (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).pretRefs), noowns(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).owns), pre(gs, ls, D3, a), rvownerok(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp, gstepf(gs, ls, D3, a).rvowns), rvownerok(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).rvowns), unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).ps), lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).vrvHp, lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl, ¬ dups(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl), gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ≠ null ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs(gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid, gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].val), gstepf(gs, ls, D3, a).orl.last = gstepf(gs, ls, D3, a).vhead ∧ (gstepf(gs, ls, D3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D3, a).qrl.tail, gstepf(gs, ls, D3, a).vs)) ∨ gstepf(gs, ls, D3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D3, a).orl.butlast.last = gstepf(gs, ls, D3, a).vhead ∧ gstepf(gs, ls, D3, a).phead ≠ gstepf(gs, ls, D3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs), gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last ∨ gstepf(gs, ls, D3, a).qrl ≠ [] ∧ gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl.butlast).last ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D3, a).vs[(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D3, a).rvowns(gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid)) = Pending(lstepf(gs, ls, D3, a).tid), gstepf(gs, ls, D3, a).vretRefs(lstepf(gs, ls, D3, a).tid) = lstepf(gs, ls, D3, a).rvref, dom gstepf(gs, ls, D3, a).vrvHp = dom gstepf(gs, ls, D3, a).prvHp, gs0 = gstepf(gs, ls, D3, a), ls0 = lstepf(gs, ls, D3, a), pc0 = D4, gstepf(gs, ls, D3, a).orl ≠ [], lstepf(gs, ls, D3, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D3), allocrv(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp), allocrv(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp), listp(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns), markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).vs), markedp(gstepf(gs, ls, D3, a).orl, gstepf(gs, ls, D3, a).ps), nextnottid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs), noid(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs), nonullRetRefs (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).pretRefs), noowns(lstepf(gs, ls, D3, a).tid, gstepf(gs, ls, D3, a).owns), pre(gs, ls, D3, a), rvownerok(gstepf(gs, ls, D3, a).pretRefs, gstepf(gs, ls, D3, a).prvHp, gstepf(gs, ls, D3, a).rvowns), rvownerok(gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp, gstepf(gs, ls, D3, a).rvowns), unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).ps), gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl, lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).prvHp, lstepf(gs, ls, D3, a).rvref ∈ gstepf(gs, ls, D3, a).vrvHp, ¬ dups(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl), gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next ≠ null ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D3, a).rvowns (gstepf(gs, ls, D3, a).vretRefs(gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].deqID.tid, gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).vhead].next].val), gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last ∨ gstepf(gs, ls, D3, a).qrl ≠ [] ∧ gstepf(gs, ls, D3, a).vtail = (gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl.butlast).last ∧ gstepf(gs, ls, D3, a).vs[gstepf(gs, ls, D3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D3, a).vs[(gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl).last].next = null, gstepf(gs, ls, D3, a).orl.last = gstepf(gs, ls, D3, a).vhead ∧ (gstepf(gs, ls, D3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D3, a).qrl.tail, gstepf(gs, ls, D3, a).vs)) ∨ gstepf(gs, ls, D3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D3, a).orl.butlast.last = gstepf(gs, ls, D3, a).vhead ∧ gstepf(gs, ls, D3, a).phead ≠ gstepf(gs, ls, D3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D3, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ D4 ≠ D34; (s) ⊦ D4 ≠ D5; (s) ⊦ D4 ≠ D6; (s) ⊦ D4 ≠ D7; (s) ⊦ D4 ≠ D16; (s) ⊦ D4 ≠ D17; (s) ⊦ D4 ≠ D25; (s) ⊦ D4 ≠ D26; (s) ⊦ D4 ≠ D31; (s) ⊦ D4 ≠ D32; (s) ⊦ D4 ≠ D33; (s) ⊦ D4 ≠ D27; (s) ⊦ D4 ≠ D28; (s) ⊦ D4 ≠ D29; (s) ⊦ D4 ≠ D30; (s) ⊦ D4 ≠ D20; (s) ⊦ D4 ≠ D21; (s) ⊦ D4 ≠ E1; (s) ⊦ D4 ≠ E12; (s) ⊦ D4 ≠ E17; (s) ⊦ D4 ≠ D8; (s) ⊦ D4 ≠ D9; (s) ⊦ D4 ≠ D10; (s) ⊦ D4 ≠ D11; (s) ⊦ D4 ≠ D12; (s) ⊦ D4 ≠ D13; (s) ⊦ D4 ≠ D14; (s) ⊦ D4 ≠ D15; (s) ⊦ D4 ≠ D18; (s) ⊦ D4 ≠ D19; (s) ⊦ D4 ≠ D22; (s) ⊦ D4 ≠ D23; (s) ⊦ D4 ≠ D24; (s) ⊦ D4 ≠ crashed; (s) ⊦ D4 ≠ idle; (s) ⊦ D4 ≠ ready; (s) ⊦ D1 ≠ D4; (s) ⊦ D2 ≠ D4; (s) ⊦ D3 ≠ D4; (s) ⊦ D4 ≠ E2; (s) ⊦ D4 ≠ E3; (s) ⊦ D4 ≠ E5; (s) ⊦ D4 ≠ E6; (s) ⊦ D4 ≠ E7; (s) ⊦ D4 ≠ E8; (s) ⊦ D4 ≠ E9; (s) ⊦ D4 ≠ E13; (s) ⊦ D4 ≠ E14; (s) ⊦ D4 ≠ E15; (s) ⊦ D4 ≠ E16; (s) ⊦ D4 ≠ E10; (s) ⊦ D4 ≠ E11; (s) ⊦ D4 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.vretRefs:= vretRefs).rvowns = gs.rvowns; (s) ⊦ (gs.vretRefs:= vretRefs).vretRefs = vretRefs; (s) ⊦ (gs.vretRefs:= vretRefs).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, D3, τ) = gs.vretRefs:= gs.vretRefs(ls.tid; ls.rvref); (s) ⊦ (gs.vretRefs:= vretRefs).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, D3, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 70 from proof copied-step-DMSQLInv (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 71 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D4, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = pcstepf(gs, ls, D4, a), DMSQGInv(gs), DMSQLInv(gs, ls, D4), pre(gs, ls, D4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D4, seq: ⊦ pcstepf(gs, ls, D4, a) = D5, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D4, a) = D5

A spec-lemma

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

gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, DMSQGInv(gs), DMSQLInv(gs, ls, D4), pre(gs, ls, D4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D4-D5, seq:⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok (gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv (gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv (gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs [gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs (gstepf(gs, ls, D4, a).vs [gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D4, a).vs [gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D4, a).vs [gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ ( gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = ( gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast ).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D4, a).vs [(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid (lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns)

Lemma step-D4-D5

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

gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, DMSQGInv(gs), DMSQLInv(gs, ls, D4), pre(gs, ls, D4, a), ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5 → gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid) ∧ ( listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps) ∧ markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs) ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps) ∧ gstepf(gs, ls, D4, a).orl ≠ [] ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl ∧ rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns) ∧ allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp) ∧ dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp ∧ ( gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs)) ∧ ( gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref ∧ lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp ∧ lstepf(gs, ls, D4, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, DMSQGInv(gs), DMSQLInv(gs, ls, D4), pre(gs, ls, D4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, gs.orl ≠ [], DMSQLInv(gs, ls, D4), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D4, a) ∧ pcstepf(gs, ls, D4, a) = D5, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D4], <all paths>

Additional information

Used simplifier rules: ⊦ D4 ≠ crashed; (s) ⊦ D4 ≠ idle; (s) ⊦ D4 ≠ ready; (s) ⊦ D4 ≠ E1; (s) ⊦ D4 ≠ E17; (s) ⊦ D1 ≠ D4; (s) ⊦ D2 ≠ D4; (s) ⊦ D4 ≠ D7; (s) ⊦ D4 ≠ D32; (s) ⊦ D4 ≠ D33; (s) ⊦ D4 ≠ E4; (s) ⊦ D4 ≠ E16; (s) ⊦ D4 ≠ E15; (s) ⊦ D4 ≠ E14; (s) ⊦ D4 ≠ E13; (s) ⊦ D4 ≠ E12; (s) ⊦ D4 ≠ E11; (s) ⊦ D4 ≠ E10; (s) ⊦ D4 ≠ E9; (s) ⊦ D4 ≠ E8; (s) ⊦ D4 ≠ E7; (s) ⊦ D4 ≠ E6; (s) ⊦ D4 ≠ E5; (s) ⊦ D4 ≠ E3; (s) ⊦ D4 ≠ E2; (s) ⊦ D4 ≠ D34; (s) ⊦ D4 ≠ D31; (s) ⊦ D4 ≠ D30; (s) ⊦ D4 ≠ D29; (s) ⊦ D4 ≠ D28; (s) ⊦ D4 ≠ D27; (s) ⊦ D4 ≠ D26; (s) ⊦ D4 ≠ D25; (s) ⊦ D4 ≠ D24; (s) ⊦ D4 ≠ D23; (s) ⊦ D4 ≠ D22; (s) ⊦ D4 ≠ D21; (s) ⊦ D4 ≠ D20; (s) ⊦ D4 ≠ D19; (s) ⊦ D4 ≠ D18; (s) ⊦ D4 ≠ D17; (s) ⊦ D4 ≠ D16; (s) ⊦ D4 ≠ D15; (s) ⊦ D4 ≠ D14; (s) ⊦ D4 ≠ D13; (s) ⊦ D4 ≠ D12; (s) ⊦ D4 ≠ D11; (s) ⊦ D4 ≠ D10; (s) ⊦ D4 ≠ D9; (s) ⊦ D4 ≠ D8; (s) ⊦ D4 ≠ D6; (s) ⊦ D4 ≠ D5; (s) ⊦ D3 ≠ D4; (s) ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D4, a) = D5; (s) Used terms: gs, ls, D4

Proof step 80 from proof copied-step-DMSQLInv (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 81 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref, gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid), gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref, dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp, gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, gstepf(gs, ls, D4, a).orl ≠ [], lstepf(gs, ls, D4, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D4), allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp), allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp), listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns), markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps), markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs), nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs), noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs), nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs), noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns), pre(gs, ls, D4, a), rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns), rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns), unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps), gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl, lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp, ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl), gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val), gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs), gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D4, a).pretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref, gstepf(gs, ls, D4, a).rvowns(gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid)) = Pending(lstepf(gs, ls, D4, a).tid), gstepf(gs, ls, D4, a).vretRefs(lstepf(gs, ls, D4, a).tid) = lstepf(gs, ls, D4, a).rvref, dom gstepf(gs, ls, D4, a).vrvHp = dom gstepf(gs, ls, D4, a).prvHp, gs0 = gstepf(gs, ls, D4, a), ls0 = lstepf(gs, ls, D4, a), pc0 = D5, gstepf(gs, ls, D4, a).orl ≠ [], lstepf(gs, ls, D4, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D4), allocrv(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp), allocrv(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp), listp(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns), markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).vs), markedp(gstepf(gs, ls, D4, a).orl, gstepf(gs, ls, D4, a).ps), nextnottid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs), noid(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs), nonullRetRefs (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).pretRefs), noowns(lstepf(gs, ls, D4, a).tid, gstepf(gs, ls, D4, a).owns), pre(gs, ls, D4, a), rvownerok(gstepf(gs, ls, D4, a).pretRefs, gstepf(gs, ls, D4, a).prvHp, gstepf(gs, ls, D4, a).rvowns), rvownerok(gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).rvowns), unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).ps), lstepf(gs, ls, D4, a).rvref ∈ gstepf(gs, ls, D4, a).vrvHp, gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl, ¬ dups(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl), gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next ≠ null ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D4, a).rvowns (gstepf(gs, ls, D4, a).vretRefs(gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].deqID.tid, gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).vhead].next].val), gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last ∨ gstepf(gs, ls, D4, a).qrl ≠ [] ∧ gstepf(gs, ls, D4, a).vtail = (gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl.butlast).last ∧ gstepf(gs, ls, D4, a).vs[gstepf(gs, ls, D4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D4, a).vs[(gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl).last].next = null, gstepf(gs, ls, D4, a).orl.last = gstepf(gs, ls, D4, a).vhead ∧ (gstepf(gs, ls, D4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D4, a).qrl.tail, gstepf(gs, ls, D4, a).vs)) ∨ gstepf(gs, ls, D4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D4, a).orl.butlast.last = gstepf(gs, ls, D4, a).vhead ∧ gstepf(gs, ls, D4, a).phead ≠ gstepf(gs, ls, D4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D4, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D5 ≠ D6; (s) ⊦ D5 ≠ D34; (s) ⊦ D5 ≠ D7; (s) ⊦ D5 ≠ D16; (s) ⊦ D5 ≠ D17; (s) ⊦ D5 ≠ D31; (s) ⊦ D5 ≠ D32; (s) ⊦ D5 ≠ D33; (s) ⊦ D5 ≠ D25; (s) ⊦ D5 ≠ D26; (s) ⊦ D5 ≠ D27; (s) ⊦ D5 ≠ D28; (s) ⊦ D5 ≠ D29; (s) ⊦ D5 ≠ D30; (s) ⊦ D5 ≠ D20; (s) ⊦ D5 ≠ D21; (s) ⊦ D5 ≠ E1; (s) ⊦ D5 ≠ E12; (s) ⊦ D5 ≠ E17; (s) ⊦ D5 ≠ D8; (s) ⊦ D5 ≠ D9; (s) ⊦ D5 ≠ D10; (s) ⊦ D5 ≠ D11; (s) ⊦ D5 ≠ D12; (s) ⊦ D5 ≠ D13; (s) ⊦ D5 ≠ D14; (s) ⊦ D5 ≠ D15; (s) ⊦ D5 ≠ D18; (s) ⊦ D5 ≠ D19; (s) ⊦ D5 ≠ D22; (s) ⊦ D5 ≠ D23; (s) ⊦ D5 ≠ D24; (s) ⊦ D5 ≠ crashed; (s) ⊦ D5 ≠ idle; (s) ⊦ D5 ≠ ready; (s) ⊦ D1 ≠ D5; (s) ⊦ D2 ≠ D5; (s) ⊦ D3 ≠ D5; (s) ⊦ D4 ≠ D5; (s) ⊦ D5 ≠ E2; (s) ⊦ D5 ≠ E3; (s) ⊦ D5 ≠ E5; (s) ⊦ D5 ≠ E6; (s) ⊦ D5 ≠ E7; (s) ⊦ D5 ≠ E8; (s) ⊦ D5 ≠ E9; (s) ⊦ D5 ≠ E13; (s) ⊦ D5 ≠ E14; (s) ⊦ D5 ≠ E15; (s) ⊦ D5 ≠ E16; (s) ⊦ D5 ≠ E10; (s) ⊦ D5 ≠ E11; (s) ⊦ D5 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.pretRefs:= vretRefs0).pretRefs = vretRefs0; (s) ⊦ (gs.pretRefs:= vretRefs0).rvowns = gs.rvowns; (s) ⊦ (gs.pretRefs:= vretRefs0).vretRefs = gs.vretRefs; (s) ⊦ (gs.pretRefs:= vretRefs0).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, D4, τ) = gs.pretRefs:= gs.pretRefs(ls.tid; gs.vretRefs(ls.tid)); (s) ⊦ (gs.pretRefs:= vretRefs0).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, D4, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 84 from proof copied-step-DMSQLInv (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 85 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D5, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = pcstepf(gs, ls, D5, a), DMSQGInv(gs), DMSQLInv(gs, ls, D5), pre(gs, ls, D5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D5, seq: ⊦ pcstepf(gs, ls, D5, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D5, a) = D6

A spec-lemma

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

gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D5), pre(gs, ls, D5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D5-D6, seq:⊦ ( gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D5, a) ∧ pcstepf(gs, ls, D5, a) = D6 → ( ( lstepf(gs, ls, D5, a).success → lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).vrvHp[lstepf(gs, ls, D5, a).rvref] ∧ lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).prvHp[lstepf(gs, ls, D5, a).rvref]) ∧ gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid)) = ( lstepf(gs, ls, D5, a).optval = Empty ∨ ¬ lstepf(gs, ls, D5, a).success ⊃ Pending(lstepf(gs, ls, D5, a).tid) ;Claimed (lstepf(gs, ls, D5, a).tid, lstepf(gs, ls, D5, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).ps, gstepf(gs, ls, D5, a).owns) ∧ ¬ dups(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).ps) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).vs) ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).ps) ∧ gstepf(gs, ls, D5, a).orl ≠ [] ∧ gstepf(gs, ls, D5, a).phead ∈ gstepf(gs, ls, D5, a).orl ∧ rvownerok (gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv (gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv (gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp) ∧ dom gstepf(gs, ls, D5, a).vrvHp = dom gstepf(gs, ls, D5, a).prvHp ∧ ( gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ≠ null ∧ gstepf(gs, ls, D5, a).vs [gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs (gstepf(gs, ls, D5, a).vs [gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D5, a).vs [gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D5, a).vs [gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D5, a).orl.last = gstepf(gs, ls, D5, a).vhead ∧ ( gstepf(gs, ls, D5, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D5, a).qrl.tail, gstepf(gs, ls, D5, a).vs)) ∨ gstepf(gs, ls, D5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D5, a).orl.butlast.last = gstepf(gs, ls, D5, a).vhead ∧ gstepf(gs, ls, D5, a).phead ≠ gstepf(gs, ls, D5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs)) ∧ ( gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last ∨ gstepf(gs, ls, D5, a).qrl ≠ [] ∧ gstepf(gs, ls, D5, a).vtail = ( gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl.butlast ).last ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D5, a).vs [(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ gstepf(gs, ls, D5, a).pretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ lstepf(gs, ls, D5, a).rvref ∈ gstepf(gs, ls, D5, a).vrvHp ∧ lstepf(gs, ls, D5, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noid (lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noowns(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D5, a) ∧ pcstepf(gs, ls, D5, a) = D6 → ( ( lstepf(gs, ls, D5, a).success → lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).vrvHp[lstepf(gs, ls, D5, a).rvref] ∧ lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).prvHp[lstepf(gs, ls, D5, a).rvref]) ∧ gstepf(gs, ls, D5, a).rvowns(gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid)) = (lstepf(gs, ls, D5, a).optval = Empty ∨ ¬ lstepf(gs, ls, D5, a).success ⊃ Pending(lstepf(gs, ls, D5, a).tid) ;Claimed(lstepf(gs, ls, D5, a).tid, lstepf(gs, ls, D5, a).optval.val) )) ∧ ( listp(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).ps, gstepf(gs, ls, D5, a).owns) ∧ ¬ dups(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).ps) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).vs) ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).ps) ∧ gstepf(gs, ls, D5, a).orl ≠ [] ∧ gstepf(gs, ls, D5, a).phead ∈ gstepf(gs, ls, D5, a).orl ∧ rvownerok(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp) ∧ dom gstepf(gs, ls, D5, a).vrvHp = dom gstepf(gs, ls, D5, a).prvHp ∧ ( gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ≠ null ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs(gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid, gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D5, a).orl.last = gstepf(gs, ls, D5, a).vhead ∧ (gstepf(gs, ls, D5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D5, a).qrl.tail, gstepf(gs, ls, D5, a).vs)) ∨ gstepf(gs, ls, D5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D5, a).orl.butlast.last = gstepf(gs, ls, D5, a).vhead ∧ gstepf(gs, ls, D5, a).phead ≠ gstepf(gs, ls, D5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs)) ∧ ( gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last ∨ gstepf(gs, ls, D5, a).qrl ≠ [] ∧ gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl.butlast).last ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D5, a).vs[(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ gstepf(gs, ls, D5, a).pretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ lstepf(gs, ls, D5, a).rvref ∈ gstepf(gs, ls, D5, a).vrvHp ∧ lstepf(gs, ls, D5, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noowns(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).owns)

Lemma step-D5-D6

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

gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D5), pre(gs, ls, D5, a), ( gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D5, a) ∧ pcstepf(gs, ls, D5, a) = D6 → ( ( lstepf(gs, ls, D5, a).success → lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).vrvHp[lstepf(gs, ls, D5, a).rvref] ∧ lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).prvHp[lstepf(gs, ls, D5, a).rvref]) ∧ gstepf(gs, ls, D5, a).rvowns(gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid)) = (lstepf(gs, ls, D5, a).optval = Empty ∨ ¬ lstepf(gs, ls, D5, a).success ⊃ Pending(lstepf(gs, ls, D5, a).tid) ;Claimed(lstepf(gs, ls, D5, a).tid, lstepf(gs, ls, D5, a).optval.val) )) ∧ ( listp(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).ps, gstepf(gs, ls, D5, a).owns) ∧ ¬ dups(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).ps) ∧ markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).vs) ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).ps) ∧ gstepf(gs, ls, D5, a).orl ≠ [] ∧ gstepf(gs, ls, D5, a).phead ∈ gstepf(gs, ls, D5, a).orl ∧ rvownerok(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp, gstepf(gs, ls, D5, a).rvowns) ∧ allocrv(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp) ∧ dom gstepf(gs, ls, D5, a).vrvHp = dom gstepf(gs, ls, D5, a).prvHp ∧ ( gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ≠ null ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs(gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid, gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D5, a).orl.last = gstepf(gs, ls, D5, a).vhead ∧ (gstepf(gs, ls, D5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D5, a).qrl.tail, gstepf(gs, ls, D5, a).vs)) ∨ gstepf(gs, ls, D5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D5, a).orl.butlast.last = gstepf(gs, ls, D5, a).vhead ∧ gstepf(gs, ls, D5, a).phead ≠ gstepf(gs, ls, D5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs)) ∧ ( gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last ∨ gstepf(gs, ls, D5, a).qrl ≠ [] ∧ gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl.butlast).last ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D5, a).vs[(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ gstepf(gs, ls, D5, a).pretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref ∧ lstepf(gs, ls, D5, a).rvref ∈ gstepf(gs, ls, D5, a).vrvHp ∧ lstepf(gs, ls, D5, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs) ∧ noowns(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D5), pre(gs, ls, D5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D5, a) ∧ pcstepf(gs, ls, D5, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D5), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D5, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D5, a) ∧ pcstepf(gs, ls, D5, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D5], <all paths>

Additional information

Used simplifier rules: ⊦ D5 ≠ crashed; (s) ⊦ D5 ≠ idle; (s) ⊦ D5 ≠ ready; (s) ⊦ D5 ≠ E1; (s) ⊦ D5 ≠ E17; (s) ⊦ D1 ≠ D5; (s) ⊦ D2 ≠ D5; (s) ⊦ D5 ≠ D7; (s) ⊦ D5 ≠ D32; (s) ⊦ D5 ≠ D33; (s) ⊦ D5 ≠ E4; (s) ⊦ D5 ≠ E16; (s) ⊦ D5 ≠ E15; (s) ⊦ D5 ≠ E14; (s) ⊦ D5 ≠ E13; (s) ⊦ D5 ≠ E12; (s) ⊦ D5 ≠ E11; (s) ⊦ D5 ≠ E10; (s) ⊦ D5 ≠ E9; (s) ⊦ D5 ≠ E8; (s) ⊦ D5 ≠ E7; (s) ⊦ D5 ≠ E6; (s) ⊦ D5 ≠ E5; (s) ⊦ D5 ≠ E3; (s) ⊦ D5 ≠ E2; (s) ⊦ D5 ≠ D34; (s) ⊦ D5 ≠ D31; (s) ⊦ D5 ≠ D30; (s) ⊦ D5 ≠ D29; (s) ⊦ D5 ≠ D28; (s) ⊦ D5 ≠ D27; (s) ⊦ D5 ≠ D26; (s) ⊦ D5 ≠ D25; (s) ⊦ D5 ≠ D24; (s) ⊦ D5 ≠ D23; (s) ⊦ D5 ≠ D22; (s) ⊦ D5 ≠ D21; (s) ⊦ D5 ≠ D20; (s) ⊦ D5 ≠ D19; (s) ⊦ D5 ≠ D18; (s) ⊦ D5 ≠ D17; (s) ⊦ D5 ≠ D16; (s) ⊦ D5 ≠ D15; (s) ⊦ D5 ≠ D14; (s) ⊦ D5 ≠ D13; (s) ⊦ D5 ≠ D12; (s) ⊦ D5 ≠ D11; (s) ⊦ D5 ≠ D10; (s) ⊦ D5 ≠ D9; (s) ⊦ D5 ≠ D8; (s) ⊦ D5 ≠ D6; (s) ⊦ D4 ≠ D5; (s) ⊦ D3 ≠ D5; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D5, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D5, a) = D6; (s) Used terms: gs, ls, D5

Proof step 94 from proof copied-step-DMSQLInv (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 95 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D5, a).pretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref, gstepf(gs, ls, D5, a).rvowns(gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid)) = (lstepf(gs, ls, D5, a).optval = Empty ∨ ¬ lstepf(gs, ls, D5, a).success ⊃ Pending(lstepf(gs, ls, D5, a).tid) ;Claimed(lstepf(gs, ls, D5, a).tid, lstepf(gs, ls, D5, a).optval.val) ), gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref, dom gstepf(gs, ls, D5, a).vrvHp = dom gstepf(gs, ls, D5, a).prvHp, gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, gstepf(gs, ls, D5, a).orl ≠ [], lstepf(gs, ls, D5, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D5), allocrv(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp), allocrv(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp), listp(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).ps, gstepf(gs, ls, D5, a).owns), markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).ps), markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).vs), nextnottid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs), noid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs), nonullRetRefs (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).pretRefs), noowns(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).owns), pre(gs, ls, D5, a), rvownerok(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).rvowns), rvownerok(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp, gstepf(gs, ls, D5, a).rvowns), unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).ps), gstepf(gs, ls, D5, a).phead ∈ gstepf(gs, ls, D5, a).orl, lstepf(gs, ls, D5, a).rvref ∈ gstepf(gs, ls, D5, a).vrvHp, ¬ dups(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl), lstepf(gs, ls, D5, a).success → lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).vrvHp[lstepf(gs, ls, D5, a).rvref] ∧ lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).prvHp[lstepf(gs, ls, D5, a).rvref], gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ≠ null ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs(gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid, gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].val), gstepf(gs, ls, D5, a).orl.last = gstepf(gs, ls, D5, a).vhead ∧ (gstepf(gs, ls, D5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D5, a).qrl.tail, gstepf(gs, ls, D5, a).vs)) ∨ gstepf(gs, ls, D5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D5, a).orl.butlast.last = gstepf(gs, ls, D5, a).vhead ∧ gstepf(gs, ls, D5, a).phead ≠ gstepf(gs, ls, D5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs), gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last ∨ gstepf(gs, ls, D5, a).qrl ≠ [] ∧ gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl.butlast).last ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D5, a).vs[(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D5, a).pretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref, gstepf(gs, ls, D5, a).rvowns(gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid)) = (lstepf(gs, ls, D5, a).optval = Empty ∨ ¬ lstepf(gs, ls, D5, a).success ⊃ Pending(lstepf(gs, ls, D5, a).tid) ;Claimed(lstepf(gs, ls, D5, a).tid, lstepf(gs, ls, D5, a).optval.val) ), gstepf(gs, ls, D5, a).vretRefs(lstepf(gs, ls, D5, a).tid) = lstepf(gs, ls, D5, a).rvref, dom gstepf(gs, ls, D5, a).vrvHp = dom gstepf(gs, ls, D5, a).prvHp, gs0 = gstepf(gs, ls, D5, a), ls0 = lstepf(gs, ls, D5, a), pc0 = D6, gstepf(gs, ls, D5, a).orl ≠ [], lstepf(gs, ls, D5, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D5), allocrv(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp), allocrv(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp), listp(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).ps, gstepf(gs, ls, D5, a).owns), markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).vs), markedp(gstepf(gs, ls, D5, a).orl, gstepf(gs, ls, D5, a).ps), nextnottid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs), noid(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vhead, gstepf(gs, ls, D5, a).vs), nonullRetRefs (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs, gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).pretRefs), noowns(lstepf(gs, ls, D5, a).tid, gstepf(gs, ls, D5, a).owns), pre(gs, ls, D5, a), rvownerok(gstepf(gs, ls, D5, a).pretRefs, gstepf(gs, ls, D5, a).prvHp, gstepf(gs, ls, D5, a).rvowns), rvownerok(gstepf(gs, ls, D5, a).vretRefs, gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).rvowns), unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).ps), lstepf(gs, ls, D5, a).rvref ∈ gstepf(gs, ls, D5, a).vrvHp, gstepf(gs, ls, D5, a).phead ∈ gstepf(gs, ls, D5, a).orl, ¬ dups(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl), gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next ≠ null ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D5, a).rvowns (gstepf(gs, ls, D5, a).vretRefs(gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].deqID.tid, gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).vhead].next].val), lstepf(gs, ls, D5, a).success → lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).vrvHp[lstepf(gs, ls, D5, a).rvref] ∧ lstepf(gs, ls, D5, a).optval = gstepf(gs, ls, D5, a).prvHp[lstepf(gs, ls, D5, a).rvref], gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last ∨ gstepf(gs, ls, D5, a).qrl ≠ [] ∧ gstepf(gs, ls, D5, a).vtail = (gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl.butlast).last ∧ gstepf(gs, ls, D5, a).vs[gstepf(gs, ls, D5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D5, a).vs[(gstepf(gs, ls, D5, a).orl + gstepf(gs, ls, D5, a).qrl).last].next = null, gstepf(gs, ls, D5, a).orl.last = gstepf(gs, ls, D5, a).vhead ∧ (gstepf(gs, ls, D5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D5, a).qrl.tail, gstepf(gs, ls, D5, a).vs)) ∨ gstepf(gs, ls, D5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D5, a).orl.butlast.last = gstepf(gs, ls, D5, a).vhead ∧ gstepf(gs, ls, D5, a).phead ≠ gstepf(gs, ls, D5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D5, a).qrl, gstepf(gs, ls, D5, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D5, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.success:= success).optval = ls.optval; (s) ⊦ (ls.success:= success).success ↔ success; (s) ⊦ (ls.success:= success).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D5, τ) = gs; (s) ⊦ lstepf(gs, ls, D5, τ) = ls.success:= false; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 98 from proof copied-step-DMSQLInv (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 99 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D6, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = pcstepf(gs, ls, D6, a), DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D6, seq: ⊦ pcstepf(gs, ls, D6, a) = (¬ ls.success ⊃ D7;D34), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D6, a) = (¬ ls.success ⊃ D7;D34)

A spec-lemma

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = (¬ ls.success ⊃ D7;D34), DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D6-D7, seq:⊦ ( ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D7 → ( listp (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok (gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv (gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv (gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs (gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ ( gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = ( gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast ).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D6, a).vs [(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D6, a).success ∧ gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = Pending(lstepf(gs, ls, D6, a).tid)) ∧ ( gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ lstepf(gs, ls, D6, a).rvref ∈ gstepf(gs, ls, D6, a).vrvHp ∧ lstepf(gs, ls, D6, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid (lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D7 → ( listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D6, a).success ∧ gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = Pending(lstepf(gs, ls, D6, a).tid)) ∧ ( gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ lstepf(gs, ls, D6, a).rvref ∈ gstepf(gs, ls, D6, a).vrvHp ∧ lstepf(gs, ls, D6, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns)

Lemma step-D6-D7

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a), ¬ ls.success, ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D7 → ( listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D6, a).success ∧ gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = Pending(lstepf(gs, ls, D6, a).tid)) ∧ ( gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref ∧ lstepf(gs, ls, D6, a).rvref ∈ gstepf(gs, ls, D6, a).vrvHp ∧ lstepf(gs, ls, D6, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D7

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, gs.orl ≠ [], DMSQLInv(gs, ls, D6), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D6, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D7, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D6], <all paths>

Additional information

Used simplifier rules: ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E17; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ E4; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D8; (s) ⊦ D5 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D6, a) = (¬ ls.success ⊃ D7;D34); (s) Used terms: gs, ls, D6

Proof step 109 from proof copied-step-DMSQLInv (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 110 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref, gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = Pending(lstepf(gs, ls, D6, a).tid), gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref, dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, gstepf(gs, ls, D6, a).orl ≠ [], lstepf(gs, ls, D6, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D6), allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp), allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp), listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs), nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs), noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), pre(gs, ls, D6, a), rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns), rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns), unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps), gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl, lstepf(gs, ls, D6, a).rvref ∈ gstepf(gs, ls, D6, a).vrvHp, ¬ lstepf(gs, ls, D6, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl), gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val), gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs), gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref, gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = Pending(lstepf(gs, ls, D6, a).tid), gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = lstepf(gs, ls, D6, a).rvref, dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D7, gstepf(gs, ls, D6, a).orl ≠ [], lstepf(gs, ls, D6, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D6), allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp), allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp), listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps), nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs), noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), pre(gs, ls, D6, a), rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns), rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns), unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps), lstepf(gs, ls, D6, a).rvref ∈ gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl, ¬ lstepf(gs, ls, D6, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl), gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val), gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null, gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D7 ≠ D16; (s) ⊦ D7 ≠ D17; (s) ⊦ D7 ≠ D31; (s) ⊦ D7 ≠ D34; (s) ⊦ D7 ≠ D25; (s) ⊦ D7 ≠ D26; (s) ⊦ D7 ≠ D27; (s) ⊦ D7 ≠ D28; (s) ⊦ D7 ≠ D29; (s) ⊦ D7 ≠ D30; (s) ⊦ D7 ≠ D20; (s) ⊦ D7 ≠ D21; (s) ⊦ D7 ≠ E1; (s) ⊦ D7 ≠ E12; (s) ⊦ D7 ≠ E17; (s) ⊦ D7 ≠ D8; (s) ⊦ D7 ≠ D9; (s) ⊦ D7 ≠ D10; (s) ⊦ D7 ≠ D11; (s) ⊦ D7 ≠ D12; (s) ⊦ D7 ≠ D13; (s) ⊦ D7 ≠ D14; (s) ⊦ D7 ≠ D15; (s) ⊦ D7 ≠ D18; (s) ⊦ D7 ≠ D19; (s) ⊦ D7 ≠ D22; (s) ⊦ D7 ≠ D23; (s) ⊦ D7 ≠ D24; (s) ⊦ D7 ≠ crashed; (s) ⊦ D7 ≠ idle; (s) ⊦ D7 ≠ ready; (s) ⊦ D1 ≠ D7; (s) ⊦ D2 ≠ D7; (s) ⊦ D3 ≠ D7; (s) ⊦ D4 ≠ D7; (s) ⊦ D5 ≠ D7; (s) ⊦ D6 ≠ D7; (s) ⊦ D7 ≠ E2; (s) ⊦ D7 ≠ E3; (s) ⊦ D7 ≠ E5; (s) ⊦ D7 ≠ E6; (s) ⊦ D7 ≠ E7; (s) ⊦ D7 ≠ E8; (s) ⊦ D7 ≠ E9; (s) ⊦ D7 ≠ E13; (s) ⊦ D7 ≠ E14; (s) ⊦ D7 ≠ E15; (s) ⊦ D7 ≠ E16; (s) ⊦ D7 ≠ E10; (s) ⊦ D7 ≠ E11; (s) ⊦ D7 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D6, τ) = gs; (s) ⊦ lstepf(gs, ls, D6, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 113 from proof copied-step-DMSQLInv (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 114 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D6-D34, seq:⊦ ( ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D34 → ( lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).vrvHp [gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ] ∧ lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).prvHp [gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) ] ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ∈ gstepf(gs, ls, D6, a).vrvHp ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ≠ null ∧ gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = (lstepf(gs, ls, D6, a).optval = Empty ⊃ Pending(lstepf(gs, ls, D6, a).tid) ;Claimed (lstepf(gs, ls, D6, a).tid, lstepf(gs, ls, D6, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok (gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv (gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv (gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs (gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D6, a).vs [gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ ( gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = ( gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast ).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D6, a).vs [(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid (lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D34 → ( lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).vrvHp[gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)] ∧ lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).prvHp[gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid)] ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ∈ gstepf(gs, ls, D6, a).vrvHp ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ≠ null ∧ gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = (lstepf(gs, ls, D6, a).optval = Empty ⊃ Pending(lstepf(gs, ls, D6, a).tid) ;Claimed(lstepf(gs, ls, D6, a).tid, lstepf(gs, ls, D6, a).optval.val) )) ∧ ( listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns)

Lemma step-D6-D34

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a), ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D34 → ( lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).vrvHp[gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)] ∧ lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).prvHp[gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid)] ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid) ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ∈ gstepf(gs, ls, D6, a).vrvHp ∧ gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ≠ null ∧ gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = (lstepf(gs, ls, D6, a).optval = Empty ⊃ Pending(lstepf(gs, ls, D6, a).tid) ;Claimed(lstepf(gs, ls, D6, a).tid, lstepf(gs, ls, D6, a).optval.val) )) ∧ ( listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns) ∧ ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps) ∧ markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs) ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps) ∧ gstepf(gs, ls, D6, a).orl ≠ [] ∧ gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl ∧ rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns) ∧ allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp) ∧ dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp ∧ ( gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs)) ∧ ( gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs) ∧ noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D6), pre(gs, ls, D6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D34

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, gs.orl ≠ [], ls.success, DMSQLInv(gs, ls, D6), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D6, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( (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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D6, a) ∧ pcstepf(gs, ls, D6, a) = D34, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D6], <all paths>

Additional information

Used simplifier rules: ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E17; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ E4; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D8; (s) ⊦ D5 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D6, a) = (¬ ls.success ⊃ D7;D34); (s) Used terms: gs, ls, D6

Proof step 120 from proof copied-step-DMSQLInv (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 121 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).vrvHp[gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)], lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).prvHp[gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid)], gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = (lstepf(gs, ls, D6, a).optval = Empty ⊃ Pending(lstepf(gs, ls, D6, a).tid);Claimed(lstepf(gs, ls, D6, a).tid, lstepf(gs, ls, D6, a).optval.val)), gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid), dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, gstepf(gs, ls, D6, a).orl ≠ [], gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ≠ null, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D6), allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp), allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp), listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs), nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs), noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), pre(gs, ls, D6, a), rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns), rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns), unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps), gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ∈ gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl, ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl), gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val), gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs), gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).prvHp[gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid)], lstepf(gs, ls, D6, a).optval = gstepf(gs, ls, D6, a).vrvHp[gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)], gstepf(gs, ls, D6, a).rvowns(gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid)) = (lstepf(gs, ls, D6, a).optval = Empty ⊃ Pending(lstepf(gs, ls, D6, a).tid);Claimed(lstepf(gs, ls, D6, a).tid, lstepf(gs, ls, D6, a).optval.val)), gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) = gstepf(gs, ls, D6, a).pretRefs(lstepf(gs, ls, D6, a).tid), dom gstepf(gs, ls, D6, a).vrvHp = dom gstepf(gs, ls, D6, a).prvHp, gs0 = gstepf(gs, ls, D6, a), ls0 = lstepf(gs, ls, D6, a), pc0 = D34, gstepf(gs, ls, D6, a).orl ≠ [], gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ≠ null, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D6), allocrv(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp), allocrv(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp), listp(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).ps, gstepf(gs, ls, D6, a).owns), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vs), markedp(gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).ps), nextnottid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), noid(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vhead, gstepf(gs, ls, D6, a).vs), nonullRetRefs (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs, gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).pretRefs), noowns(lstepf(gs, ls, D6, a).tid, gstepf(gs, ls, D6, a).owns), pre(gs, ls, D6, a), rvownerok(gstepf(gs, ls, D6, a).pretRefs, gstepf(gs, ls, D6, a).prvHp, gstepf(gs, ls, D6, a).rvowns), rvownerok(gstepf(gs, ls, D6, a).vretRefs, gstepf(gs, ls, D6, a).vrvHp, gstepf(gs, ls, D6, a).rvowns), unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).ps), gstepf(gs, ls, D6, a).phead ∈ gstepf(gs, ls, D6, a).orl, gstepf(gs, ls, D6, a).vretRefs(lstepf(gs, ls, D6, a).tid) ∈ gstepf(gs, ls, D6, a).vrvHp, ¬ dups(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl), gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next ≠ null ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D6, a).rvowns (gstepf(gs, ls, D6, a).vretRefs(gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].deqID.tid, gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).vhead].next].val), gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last ∨ gstepf(gs, ls, D6, a).qrl ≠ [] ∧ gstepf(gs, ls, D6, a).vtail = (gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl.butlast).last ∧ gstepf(gs, ls, D6, a).vs[gstepf(gs, ls, D6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D6, a).vs[(gstepf(gs, ls, D6, a).orl + gstepf(gs, ls, D6, a).qrl).last].next = null, gstepf(gs, ls, D6, a).orl.last = gstepf(gs, ls, D6, a).vhead ∧ (gstepf(gs, ls, D6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D6, a).qrl.tail, gstepf(gs, ls, D6, a).vs)) ∨ gstepf(gs, ls, D6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D6, a).orl.butlast.last = gstepf(gs, ls, D6, a).vhead ∧ gstepf(gs, ls, D6, a).phead ≠ gstepf(gs, ls, D6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D6, a).qrl, gstepf(gs, ls, D6, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D6, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D34 ≠ E1; (s) ⊦ D34 ≠ E12; (s) ⊦ D34 ≠ E17; (s) ⊦ D34 ≠ crashed; (s) ⊦ D34 ≠ idle; (s) ⊦ D34 ≠ ready; (s) ⊦ D1 ≠ D34; (s) ⊦ D2 ≠ D34; (s) ⊦ D3 ≠ D34; (s) ⊦ D4 ≠ D34; (s) ⊦ D5 ≠ D34; (s) ⊦ D6 ≠ D34; (s) ⊦ D7 ≠ 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) ⊦ D32 ≠ D34; (s) ⊦ D33 ≠ D34; (s) ⊦ D34 ≠ E2; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D6, τ) = gs; (s) ⊦ lstepf(gs, ls, D6, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 124 from proof copied-step-DMSQLInv (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 125 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D7, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = pcstepf(gs, ls, D7, a), DMSQGInv(gs), DMSQLInv(gs, ls, D7), pre(gs, ls, D7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D7, seq: ⊦ pcstepf(gs, ls, D7, a) = D8, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D7, a) = D8

A spec-lemma

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

gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, DMSQGInv(gs), DMSQLInv(gs, ls, D7), pre(gs, ls, D7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D7-D8, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D7, a) ∧ pcstepf(gs, ls, D7, a) = D8 → gstepf(gs, ls, D7, a).vtail ∈ gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl from lstepf(gs, ls, D7, a).first ∧ ( listp (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).ps, gstepf(gs, ls, D7, a).owns) ∧ ¬ dups(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).ps) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vs) ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).ps) ∧ gstepf(gs, ls, D7, a).orl ≠ [] ∧ gstepf(gs, ls, D7, a).phead ∈ gstepf(gs, ls, D7, a).orl ∧ rvownerok (gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv (gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv (gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp) ∧ dom gstepf(gs, ls, D7, a).vrvHp = dom gstepf(gs, ls, D7, a).prvHp ∧ ( gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ≠ null ∧ gstepf(gs, ls, D7, a).vs [gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs (gstepf(gs, ls, D7, a).vs [gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D7, a).vs [gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D7, a).vs [gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D7, a).orl.last = gstepf(gs, ls, D7, a).vhead ∧ ( gstepf(gs, ls, D7, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D7, a).qrl.tail, gstepf(gs, ls, D7, a).vs)) ∨ gstepf(gs, ls, D7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D7, a).orl.butlast.last = gstepf(gs, ls, D7, a).vhead ∧ gstepf(gs, ls, D7, a).phead ≠ gstepf(gs, ls, D7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs)) ∧ ( gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last ∨ gstepf(gs, ls, D7, a).qrl ≠ [] ∧ gstepf(gs, ls, D7, a).vtail = ( gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl.butlast ).last ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D7, a).vs [(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D7, a).success ∧ gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid)) = Pending(lstepf(gs, ls, D7, a).tid)) ∧ ( lstepf(gs, ls, D7, a).first ∈ gstepf(gs, ls, D7, a).orl ∧ gstepf(gs, ls, D7, a).vhead ∈ gstepf(gs, ls, D7, a).orl from lstepf(gs, ls, D7, a).first) ∧ ( gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ gstepf(gs, ls, D7, a).pretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ lstepf(gs, ls, D7, a).rvref ∈ gstepf(gs, ls, D7, a).vrvHp ∧ lstepf(gs, ls, D7, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).vhead, gstepf(gs, ls, D7, a).vs) ∧ noid (lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).vs) ∧ noowns(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D7, a) ∧ pcstepf(gs, ls, D7, a) = D8 → gstepf(gs, ls, D7, a).vtail ∈ gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl from lstepf(gs, ls, D7, a).first ∧ ( listp(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).ps, gstepf(gs, ls, D7, a).owns) ∧ ¬ dups(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).ps) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vs) ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).ps) ∧ gstepf(gs, ls, D7, a).orl ≠ [] ∧ gstepf(gs, ls, D7, a).phead ∈ gstepf(gs, ls, D7, a).orl ∧ rvownerok(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp) ∧ dom gstepf(gs, ls, D7, a).vrvHp = dom gstepf(gs, ls, D7, a).prvHp ∧ ( gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ≠ null ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs(gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid, gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D7, a).orl.last = gstepf(gs, ls, D7, a).vhead ∧ (gstepf(gs, ls, D7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D7, a).qrl.tail, gstepf(gs, ls, D7, a).vs)) ∨ gstepf(gs, ls, D7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D7, a).orl.butlast.last = gstepf(gs, ls, D7, a).vhead ∧ gstepf(gs, ls, D7, a).phead ≠ gstepf(gs, ls, D7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs)) ∧ ( gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last ∨ gstepf(gs, ls, D7, a).qrl ≠ [] ∧ gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl.butlast).last ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D7, a).vs[(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D7, a).success ∧ gstepf(gs, ls, D7, a).rvowns(gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid)) = Pending(lstepf(gs, ls, D7, a).tid)) ∧ ( lstepf(gs, ls, D7, a).first ∈ gstepf(gs, ls, D7, a).orl ∧ gstepf(gs, ls, D7, a).vhead ∈ gstepf(gs, ls, D7, a).orl from lstepf(gs, ls, D7, a).first) ∧ ( gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ gstepf(gs, ls, D7, a).pretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ lstepf(gs, ls, D7, a).rvref ∈ gstepf(gs, ls, D7, a).vrvHp ∧ lstepf(gs, ls, D7, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).vhead, gstepf(gs, ls, D7, a).vs) ∧ noid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).vs) ∧ noowns(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).owns)

Lemma step-D7-D8

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

gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, DMSQGInv(gs), DMSQLInv(gs, ls, D7), pre(gs, ls, D7, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D7, a) ∧ pcstepf(gs, ls, D7, a) = D8 → gstepf(gs, ls, D7, a).vtail ∈ gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl from lstepf(gs, ls, D7, a).first ∧ ( listp(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).ps, gstepf(gs, ls, D7, a).owns) ∧ ¬ dups(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).ps) ∧ markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vs) ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).ps) ∧ gstepf(gs, ls, D7, a).orl ≠ [] ∧ gstepf(gs, ls, D7, a).phead ∈ gstepf(gs, ls, D7, a).orl ∧ rvownerok(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp, gstepf(gs, ls, D7, a).rvowns) ∧ allocrv(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp) ∧ dom gstepf(gs, ls, D7, a).vrvHp = dom gstepf(gs, ls, D7, a).prvHp ∧ ( gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ≠ null ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs(gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid, gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D7, a).orl.last = gstepf(gs, ls, D7, a).vhead ∧ (gstepf(gs, ls, D7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D7, a).qrl.tail, gstepf(gs, ls, D7, a).vs)) ∨ gstepf(gs, ls, D7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D7, a).orl.butlast.last = gstepf(gs, ls, D7, a).vhead ∧ gstepf(gs, ls, D7, a).phead ≠ gstepf(gs, ls, D7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs)) ∧ ( gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last ∨ gstepf(gs, ls, D7, a).qrl ≠ [] ∧ gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl.butlast).last ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D7, a).vs[(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D7, a).success ∧ gstepf(gs, ls, D7, a).rvowns(gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid)) = Pending(lstepf(gs, ls, D7, a).tid)) ∧ ( lstepf(gs, ls, D7, a).first ∈ gstepf(gs, ls, D7, a).orl ∧ gstepf(gs, ls, D7, a).vhead ∈ gstepf(gs, ls, D7, a).orl from lstepf(gs, ls, D7, a).first) ∧ ( gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ gstepf(gs, ls, D7, a).pretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref ∧ lstepf(gs, ls, D7, a).rvref ∈ gstepf(gs, ls, D7, a).vrvHp ∧ lstepf(gs, ls, D7, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).vhead, gstepf(gs, ls, D7, a).vs) ∧ noid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).vs) ∧ noowns(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, DMSQGInv(gs), DMSQLInv(gs, ls, D7), pre(gs, ls, D7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D7, a) ∧ pcstepf(gs, ls, D7, a) = D8

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, gs.orl ≠ [], DMSQLInv(gs, ls, D7), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D7, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D7, a) ∧ pcstepf(gs, ls, D7, a) = D8, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D7], <all paths>

Additional information

Used simplifier rules: ⊦ D7 ≠ crashed; (s) ⊦ D7 ≠ idle; (s) ⊦ D7 ≠ ready; (s) ⊦ D7 ≠ E1; (s) ⊦ D7 ≠ E17; (s) ⊦ D1 ≠ D7; (s) ⊦ D2 ≠ D7; (s) ⊦ D7 ≠ E4; (s) ⊦ D7 ≠ E16; (s) ⊦ D7 ≠ E15; (s) ⊦ D7 ≠ E14; (s) ⊦ D7 ≠ E13; (s) ⊦ D7 ≠ E12; (s) ⊦ D7 ≠ E11; (s) ⊦ D7 ≠ E10; (s) ⊦ D7 ≠ E9; (s) ⊦ D7 ≠ E8; (s) ⊦ D7 ≠ E7; (s) ⊦ D7 ≠ E6; (s) ⊦ D7 ≠ E5; (s) ⊦ D7 ≠ E3; (s) ⊦ D7 ≠ E2; (s) ⊦ D7 ≠ D34; (s) ⊦ D7 ≠ D31; (s) ⊦ D7 ≠ D30; (s) ⊦ D7 ≠ D29; (s) ⊦ D7 ≠ D28; (s) ⊦ D7 ≠ D27; (s) ⊦ D7 ≠ D26; (s) ⊦ D7 ≠ D25; (s) ⊦ D7 ≠ D24; (s) ⊦ D7 ≠ D23; (s) ⊦ D7 ≠ D22; (s) ⊦ D7 ≠ D21; (s) ⊦ D7 ≠ D20; (s) ⊦ D7 ≠ D19; (s) ⊦ D7 ≠ D18; (s) ⊦ D7 ≠ D17; (s) ⊦ D7 ≠ D16; (s) ⊦ D7 ≠ D15; (s) ⊦ D7 ≠ D14; (s) ⊦ D7 ≠ D13; (s) ⊦ D7 ≠ D12; (s) ⊦ D7 ≠ D11; (s) ⊦ D7 ≠ D10; (s) ⊦ D7 ≠ D9; (s) ⊦ D7 ≠ D8; (s) ⊦ D6 ≠ D7; (s) ⊦ D5 ≠ D7; (s) ⊦ D4 ≠ D7; (s) ⊦ D3 ≠ D7; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D7, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D7, a) = D8; (s) Used terms: gs, ls, D7

Proof step 134 from proof copied-step-DMSQLInv (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 135 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D7, a).pretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref, gstepf(gs, ls, D7, a).rvowns(gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid)) = Pending(lstepf(gs, ls, D7, a).tid), gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref, dom gstepf(gs, ls, D7, a).vrvHp = dom gstepf(gs, ls, D7, a).prvHp, gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, gstepf(gs, ls, D7, a).orl ≠ [], lstepf(gs, ls, D7, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D7), allocrv(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp), allocrv(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp), listp(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).ps, gstepf(gs, ls, D7, a).owns), markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).ps), markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vs), nextnottid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).vhead, gstepf(gs, ls, D7, a).vs), noid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).vs), nonullRetRefs (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).pretRefs), noowns(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).owns), pre(gs, ls, D7, a), rvownerok(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).rvowns), rvownerok(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp, gstepf(gs, ls, D7, a).rvowns), unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).ps), gstepf(gs, ls, D7, a).vtail ∈ gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl from lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).phead ∈ gstepf(gs, ls, D7, a).orl, lstepf(gs, ls, D7, a).first ∈ gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vhead ∈ gstepf(gs, ls, D7, a).orl from lstepf(gs, ls, D7, a).first, lstepf(gs, ls, D7, a).rvref ∈ gstepf(gs, ls, D7, a).vrvHp, ¬ lstepf(gs, ls, D7, a).success, ¬ dups(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl), gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ≠ null ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs(gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid, gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].val), gstepf(gs, ls, D7, a).orl.last = gstepf(gs, ls, D7, a).vhead ∧ (gstepf(gs, ls, D7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D7, a).qrl.tail, gstepf(gs, ls, D7, a).vs)) ∨ gstepf(gs, ls, D7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D7, a).orl.butlast.last = gstepf(gs, ls, D7, a).vhead ∧ gstepf(gs, ls, D7, a).phead ≠ gstepf(gs, ls, D7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs), gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last ∨ gstepf(gs, ls, D7, a).qrl ≠ [] ∧ gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl.butlast).last ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D7, a).vs[(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D7, a).pretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref, gstepf(gs, ls, D7, a).rvowns(gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid)) = Pending(lstepf(gs, ls, D7, a).tid), gstepf(gs, ls, D7, a).vretRefs(lstepf(gs, ls, D7, a).tid) = lstepf(gs, ls, D7, a).rvref, dom gstepf(gs, ls, D7, a).vrvHp = dom gstepf(gs, ls, D7, a).prvHp, gs0 = gstepf(gs, ls, D7, a), ls0 = lstepf(gs, ls, D7, a), pc0 = D8, gstepf(gs, ls, D7, a).orl ≠ [], lstepf(gs, ls, D7, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D7), allocrv(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp), allocrv(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp), listp(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).ps, gstepf(gs, ls, D7, a).owns), markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vs), markedp(gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).ps), nextnottid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).vhead, gstepf(gs, ls, D7, a).vs), noid(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, lstepf(gs, ls, D7, a).first, gstepf(gs, ls, D7, a).vs), nonullRetRefs (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs, gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).pretRefs), noowns(lstepf(gs, ls, D7, a).tid, gstepf(gs, ls, D7, a).owns), pre(gs, ls, D7, a), rvownerok(gstepf(gs, ls, D7, a).pretRefs, gstepf(gs, ls, D7, a).prvHp, gstepf(gs, ls, D7, a).rvowns), rvownerok(gstepf(gs, ls, D7, a).vretRefs, gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).rvowns), unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).ps), lstepf(gs, ls, D7, a).rvref ∈ gstepf(gs, ls, D7, a).vrvHp, gstepf(gs, ls, D7, a).vhead ∈ gstepf(gs, ls, D7, a).orl from lstepf(gs, ls, D7, a).first, lstepf(gs, ls, D7, a).first ∈ gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).phead ∈ gstepf(gs, ls, D7, a).orl, gstepf(gs, ls, D7, a).vtail ∈ gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl from lstepf(gs, ls, D7, a).first, ¬ lstepf(gs, ls, D7, a).success, ¬ dups(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl), gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next ≠ null ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D7, a).rvowns (gstepf(gs, ls, D7, a).vretRefs(gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].deqID.tid, gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).vhead].next].val), gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last ∨ gstepf(gs, ls, D7, a).qrl ≠ [] ∧ gstepf(gs, ls, D7, a).vtail = (gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl.butlast).last ∧ gstepf(gs, ls, D7, a).vs[gstepf(gs, ls, D7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D7, a).vs[(gstepf(gs, ls, D7, a).orl + gstepf(gs, ls, D7, a).qrl).last].next = null, gstepf(gs, ls, D7, a).orl.last = gstepf(gs, ls, D7, a).vhead ∧ (gstepf(gs, ls, D7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D7, a).qrl.tail, gstepf(gs, ls, D7, a).vs)) ∨ gstepf(gs, ls, D7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D7, a).orl.butlast.last = gstepf(gs, ls, D7, a).vhead ∧ gstepf(gs, ls, D7, a).phead ≠ gstepf(gs, ls, D7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D7, a).qrl, gstepf(gs, ls, D7, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D7, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D8 ≠ D12; (s) ⊦ D8 ≠ D13; (s) ⊦ D8 ≠ D14; (s) ⊦ D8 ≠ D15; (s) ⊦ D8 ≠ D9; (s) ⊦ D8 ≠ D10; (s) ⊦ D8 ≠ D11; (s) ⊦ D8 ≠ D18; (s) ⊦ D8 ≠ D19; (s) ⊦ D8 ≠ D20; (s) ⊦ D8 ≠ D21; (s) ⊦ D8 ≠ E1; (s) ⊦ D8 ≠ E12; (s) ⊦ D8 ≠ E17; (s) ⊦ D8 ≠ D16; (s) ⊦ D8 ≠ D17; (s) ⊦ D8 ≠ D25; (s) ⊦ D8 ≠ D26; (s) ⊦ D8 ≠ D27; (s) ⊦ D8 ≠ D28; (s) ⊦ D8 ≠ D29; (s) ⊦ D8 ≠ D30; (s) ⊦ D8 ≠ D31; (s) ⊦ D8 ≠ D32; (s) ⊦ D8 ≠ D33; (s) ⊦ D8 ≠ D34; (s) ⊦ D8 ≠ D22; (s) ⊦ D8 ≠ D23; (s) ⊦ D8 ≠ D24; (s) ⊦ D8 ≠ crashed; (s) ⊦ D8 ≠ idle; (s) ⊦ D8 ≠ ready; (s) ⊦ D1 ≠ D8; (s) ⊦ D2 ≠ D8; (s) ⊦ D3 ≠ D8; (s) ⊦ D4 ≠ D8; (s) ⊦ D5 ≠ D8; (s) ⊦ D6 ≠ D8; (s) ⊦ D7 ≠ D8; (s) ⊦ D8 ≠ E2; (s) ⊦ D8 ≠ E3; (s) ⊦ D8 ≠ E5; (s) ⊦ D8 ≠ E6; (s) ⊦ D8 ≠ E7; (s) ⊦ D8 ≠ E8; (s) ⊦ D8 ≠ E9; (s) ⊦ D8 ≠ E13; (s) ⊦ D8 ≠ E14; (s) ⊦ D8 ≠ E15; (s) ⊦ D8 ≠ E16; (s) ⊦ D8 ≠ E10; (s) ⊦ D8 ≠ E11; (s) ⊦ D8 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.first:= node2).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D7, τ) = gs; (s) ⊦ lstepf(gs, ls, D7, τ) = ls.first:= gs.vhead; (s) ⊦ (ls.first:= node2).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 138 from proof copied-step-DMSQLInv (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 139 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D8, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = pcstepf(gs, ls, D8, a), DMSQGInv(gs), DMSQLInv(gs, ls, D8), pre(gs, ls, D8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D8, seq: ⊦ pcstepf(gs, ls, D8, a) = D9, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D8, a) = D9

A spec-lemma

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

gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, DMSQGInv(gs), DMSQLInv(gs, ls, D8), pre(gs, ls, D8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D8-D9, seq:⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9 → gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst ∧ ( listp (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns) ∧ ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs) ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps) ∧ gstepf(gs, ls, D8, a).orl ≠ [] ∧ gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl ∧ rvownerok (gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv (gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv (gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp) ∧ dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp ∧ ( gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs [gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs (gstepf(gs, ls, D8, a).vs [gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D8, a).vs [gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D8, a).vs [gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ ( gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs)) ∧ ( gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = ( gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast ).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D8, a).vs [(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D8, a).success ∧ gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid)) ∧ ( lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl ∧ gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first) ∧ lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first ∧ ( gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp ∧ lstepf(gs, ls, D8, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs) ∧ noid (lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs) ∧ noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9 → gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst ∧ ( listp(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns) ∧ ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs) ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps) ∧ gstepf(gs, ls, D8, a).orl ≠ [] ∧ gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl ∧ rvownerok(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp) ∧ dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp ∧ ( gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid, gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ (gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs)) ∧ ( gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D8, a).vs[(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D8, a).success ∧ gstepf(gs, ls, D8, a).rvowns(gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid)) ∧ ( lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl ∧ gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first) ∧ lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first ∧ ( gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp ∧ lstepf(gs, ls, D8, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs) ∧ noid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs) ∧ noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns)

Lemma step-D8-D9

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

gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, DMSQGInv(gs), DMSQLInv(gs, ls, D8), pre(gs, ls, D8, a), ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9 → gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst ∧ ( listp(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns) ∧ ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps) ∧ markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs) ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps) ∧ gstepf(gs, ls, D8, a).orl ≠ [] ∧ gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl ∧ rvownerok(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns) ∧ allocrv(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp) ∧ dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp ∧ ( gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid, gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ (gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs)) ∧ ( gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D8, a).vs[(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D8, a).success ∧ gstepf(gs, ls, D8, a).rvowns(gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid)) ∧ ( lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl ∧ gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first) ∧ lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first ∧ ( gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref ∧ lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp ∧ lstepf(gs, ls, D8, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs) ∧ noid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs) ∧ noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, DMSQGInv(gs), DMSQLInv(gs, ls, D8), pre(gs, ls, D8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, gs.orl ≠ [], DMSQLInv(gs, ls, D8), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D8, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.first ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D8, a) ∧ pcstepf(gs, ls, D8, a) = D9, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D8], <all paths>

Additional information

Used simplifier rules: ⊦ D8 ≠ crashed; (s) ⊦ D8 ≠ D32; (s) ⊦ D8 ≠ D33; (s) ⊦ D8 ≠ idle; (s) ⊦ D8 ≠ ready; (s) ⊦ D8 ≠ E1; (s) ⊦ D8 ≠ E17; (s) ⊦ D1 ≠ D8; (s) ⊦ D2 ≠ D8; (s) ⊦ D7 ≠ D8; (s) ⊦ D8 ≠ E4; (s) ⊦ D8 ≠ E16; (s) ⊦ D8 ≠ E15; (s) ⊦ D8 ≠ E14; (s) ⊦ D8 ≠ E13; (s) ⊦ D8 ≠ E12; (s) ⊦ D8 ≠ E11; (s) ⊦ D8 ≠ E10; (s) ⊦ D8 ≠ E9; (s) ⊦ D8 ≠ E8; (s) ⊦ D8 ≠ E7; (s) ⊦ D8 ≠ E6; (s) ⊦ D8 ≠ E5; (s) ⊦ D8 ≠ E3; (s) ⊦ D8 ≠ E2; (s) ⊦ D8 ≠ D34; (s) ⊦ D8 ≠ D31; (s) ⊦ D8 ≠ D30; (s) ⊦ D8 ≠ D29; (s) ⊦ D8 ≠ D28; (s) ⊦ D8 ≠ D27; (s) ⊦ D8 ≠ D26; (s) ⊦ D8 ≠ D25; (s) ⊦ D8 ≠ D24; (s) ⊦ D8 ≠ D23; (s) ⊦ D8 ≠ D22; (s) ⊦ D8 ≠ D21; (s) ⊦ D8 ≠ D20; (s) ⊦ D8 ≠ D19; (s) ⊦ D8 ≠ D18; (s) ⊦ D8 ≠ D17; (s) ⊦ D8 ≠ D16; (s) ⊦ D8 ≠ D15; (s) ⊦ D8 ≠ D14; (s) ⊦ D8 ≠ D13; (s) ⊦ D8 ≠ D12; (s) ⊦ D8 ≠ D11; (s) ⊦ D8 ≠ D10; (s) ⊦ D8 ≠ D9; (s) ⊦ D6 ≠ D8; (s) ⊦ D5 ≠ D8; (s) ⊦ D4 ≠ D8; (s) ⊦ D3 ≠ D8; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D8, a) = D9; (s) Used terms: gs, ls, D8

Proof step 148 from proof copied-step-DMSQLInv (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 149 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref, gstepf(gs, ls, D8, a).rvowns(gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid), gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref, dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp, gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, gstepf(gs, ls, D8, a).orl ≠ [], lstepf(gs, ls, D8, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D8), allocrv(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp), allocrv(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp), listp(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns), markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps), markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs), nextnottid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs), noid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs), nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs), noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns), pre(gs, ls, D8, a), rvownerok(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns), rvownerok(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns), unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps), gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst, gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl, lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first, lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first, lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp, ¬ lstepf(gs, ls, D8, a).success, ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl), gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid, gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].val), gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ (gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs), gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D8, a).vs[(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D8, a).pretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref, gstepf(gs, ls, D8, a).rvowns(gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid)) = Pending(lstepf(gs, ls, D8, a).tid), gstepf(gs, ls, D8, a).vretRefs(lstepf(gs, ls, D8, a).tid) = lstepf(gs, ls, D8, a).rvref, dom gstepf(gs, ls, D8, a).vrvHp = dom gstepf(gs, ls, D8, a).prvHp, gs0 = gstepf(gs, ls, D8, a), ls0 = lstepf(gs, ls, D8, a), pc0 = D9, gstepf(gs, ls, D8, a).orl ≠ [], lstepf(gs, ls, D8, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D8), allocrv(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp), allocrv(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp), listp(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).ps, gstepf(gs, ls, D8, a).owns), markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vs), markedp(gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).ps), nextnottid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).vhead, gstepf(gs, ls, D8, a).vs), noid(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vs), nonullRetRefs (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs, gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).pretRefs), noowns(lstepf(gs, ls, D8, a).tid, gstepf(gs, ls, D8, a).owns), pre(gs, ls, D8, a), rvownerok(gstepf(gs, ls, D8, a).pretRefs, gstepf(gs, ls, D8, a).prvHp, gstepf(gs, ls, D8, a).rvowns), rvownerok(gstepf(gs, ls, D8, a).vretRefs, gstepf(gs, ls, D8, a).vrvHp, gstepf(gs, ls, D8, a).rvowns), unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).ps), lstepf(gs, ls, D8, a).rvref ∈ gstepf(gs, ls, D8, a).vrvHp, lstepf(gs, ls, D8, a).lst ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).first, gstepf(gs, ls, D8, a).vhead ∈ gstepf(gs, ls, D8, a).orl from lstepf(gs, ls, D8, a).first, lstepf(gs, ls, D8, a).first ∈ gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).phead ∈ gstepf(gs, ls, D8, a).orl, gstepf(gs, ls, D8, a).vtail ∈ gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl from lstepf(gs, ls, D8, a).lst, ¬ lstepf(gs, ls, D8, a).success, ¬ dups(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl), gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next ≠ null ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D8, a).rvowns (gstepf(gs, ls, D8, a).vretRefs(gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].deqID.tid, gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).vhead].next].val), gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last ∨ gstepf(gs, ls, D8, a).qrl ≠ [] ∧ gstepf(gs, ls, D8, a).vtail = (gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl.butlast).last ∧ gstepf(gs, ls, D8, a).vs[gstepf(gs, ls, D8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D8, a).vs[(gstepf(gs, ls, D8, a).orl + gstepf(gs, ls, D8, a).qrl).last].next = null, gstepf(gs, ls, D8, a).orl.last = gstepf(gs, ls, D8, a).vhead ∧ (gstepf(gs, ls, D8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D8, a).qrl.tail, gstepf(gs, ls, D8, a).vs)) ∨ gstepf(gs, ls, D8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D8, a).orl.butlast.last = gstepf(gs, ls, D8, a).vhead ∧ gstepf(gs, ls, D8, a).phead ≠ gstepf(gs, ls, D8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D8, a).qrl, gstepf(gs, ls, D8, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D8, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D9 ≠ D10; (s) ⊦ D9 ≠ D11; (s) ⊦ D9 ≠ D12; (s) ⊦ D9 ≠ D13; (s) ⊦ D9 ≠ D14; (s) ⊦ D9 ≠ D15; (s) ⊦ D9 ≠ D18; (s) ⊦ D9 ≠ D19; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D9 ≠ D20; (s) ⊦ D9 ≠ D21; (s) ⊦ D9 ≠ E1; (s) ⊦ D9 ≠ E12; (s) ⊦ D9 ≠ E17; (s) ⊦ D9 ≠ D16; (s) ⊦ D9 ≠ D17; (s) ⊦ D9 ≠ D25; (s) ⊦ D9 ≠ D26; (s) ⊦ D9 ≠ D27; (s) ⊦ D9 ≠ D28; (s) ⊦ D9 ≠ D29; (s) ⊦ D9 ≠ D30; (s) ⊦ D9 ≠ D31; (s) ⊦ D9 ≠ D32; (s) ⊦ D9 ≠ D33; (s) ⊦ D9 ≠ D34; (s) ⊦ D9 ≠ D22; (s) ⊦ D9 ≠ D23; (s) ⊦ D9 ≠ D24; (s) ⊦ D9 ≠ crashed; (s) ⊦ D9 ≠ idle; (s) ⊦ D9 ≠ ready; (s) ⊦ D1 ≠ D9; (s) ⊦ D2 ≠ D9; (s) ⊦ D3 ≠ D9; (s) ⊦ D4 ≠ D9; (s) ⊦ D5 ≠ D9; (s) ⊦ D6 ≠ D9; (s) ⊦ D7 ≠ D9; (s) ⊦ D8 ≠ D9; (s) ⊦ D9 ≠ E2; (s) ⊦ D9 ≠ E3; (s) ⊦ D9 ≠ E5; (s) ⊦ D9 ≠ E6; (s) ⊦ D9 ≠ E7; (s) ⊦ D9 ≠ E8; (s) ⊦ D9 ≠ E9; (s) ⊦ D9 ≠ E13; (s) ⊦ D9 ≠ E14; (s) ⊦ D9 ≠ E15; (s) ⊦ D9 ≠ E16; (s) ⊦ D9 ≠ E10; (s) ⊦ D9 ≠ E11; (s) ⊦ D9 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.lst:= node0).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D8, τ) = gs; (s) ⊦ lstepf(gs, ls, D8, τ) = ls.lst:= gs.vtail; (s) ⊦ (ls.lst:= node0).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 152 from proof copied-step-DMSQLInv (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 153 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D9, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = pcstepf(gs, ls, D9, a), DMSQGInv(gs), DMSQLInv(gs, ls, D9), pre(gs, ls, D9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D9, seq: ⊦ pcstepf(gs, ls, D9, a) = D10, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D9, a) = D10

A spec-lemma

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

gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, DMSQGInv(gs), DMSQLInv(gs, ls, D9), pre(gs, ls, D9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D9-D10, seq:⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D9, a) ∧ pcstepf(gs, ls, D9, a) = D10 → ( gstepf(gs, ls, D9, a).vtail ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).lst ∧ ( lstepf(gs, ls, D9, a).nxt ≠ null → lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).vs[lstepf(gs, ls, D9, a).first].next) ∧ ( lstepf(gs, ls, D9, a).first ≠ lstepf(gs, ls, D9, a).lst → lstepf(gs, ls, D9, a).nxt ≠ null ∧ lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).ps[lstepf(gs, ls, D9, a).first].next)) ∧ ( listp (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).ps, gstepf(gs, ls, D9, a).owns) ∧ ¬ dups(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).ps) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vs) ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).ps) ∧ gstepf(gs, ls, D9, a).orl ≠ [] ∧ gstepf(gs, ls, D9, a).phead ∈ gstepf(gs, ls, D9, a).orl ∧ rvownerok (gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv (gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv (gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp) ∧ dom gstepf(gs, ls, D9, a).vrvHp = dom gstepf(gs, ls, D9, a).prvHp ∧ ( gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ≠ null ∧ gstepf(gs, ls, D9, a).vs [gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs (gstepf(gs, ls, D9, a).vs [gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D9, a).vs [gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D9, a).vs [gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D9, a).orl.last = gstepf(gs, ls, D9, a).vhead ∧ ( gstepf(gs, ls, D9, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D9, a).qrl.tail, gstepf(gs, ls, D9, a).vs)) ∨ gstepf(gs, ls, D9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D9, a).orl.butlast.last = gstepf(gs, ls, D9, a).vhead ∧ gstepf(gs, ls, D9, a).phead ≠ gstepf(gs, ls, D9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs)) ∧ ( gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last ∨ gstepf(gs, ls, D9, a).qrl ≠ [] ∧ gstepf(gs, ls, D9, a).vtail = ( gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl.butlast ).last ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D9, a).vs [(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D9, a).success ∧ gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid)) = Pending(lstepf(gs, ls, D9, a).tid)) ∧ ( lstepf(gs, ls, D9, a).first ∈ gstepf(gs, ls, D9, a).orl ∧ gstepf(gs, ls, D9, a).vhead ∈ gstepf(gs, ls, D9, a).orl from lstepf(gs, ls, D9, a).first) ∧ lstepf(gs, ls, D9, a).lst ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).first ∧ ( gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ gstepf(gs, ls, D9, a).pretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ lstepf(gs, ls, D9, a).rvref ∈ gstepf(gs, ls, D9, a).vrvHp ∧ lstepf(gs, ls, D9, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).vhead, gstepf(gs, ls, D9, a).vs) ∧ noid (lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vs) ∧ noowns(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D9, a) ∧ pcstepf(gs, ls, D9, a) = D10 → ( gstepf(gs, ls, D9, a).vtail ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).lst ∧ (lstepf(gs, ls, D9, a).nxt ≠ null → lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).vs[lstepf(gs, ls, D9, a).first].next) ∧ ( lstepf(gs, ls, D9, a).first ≠ lstepf(gs, ls, D9, a).lst → lstepf(gs, ls, D9, a).nxt ≠ null ∧ lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).ps[lstepf(gs, ls, D9, a).first].next)) ∧ ( listp(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).ps, gstepf(gs, ls, D9, a).owns) ∧ ¬ dups(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).ps) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vs) ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).ps) ∧ gstepf(gs, ls, D9, a).orl ≠ [] ∧ gstepf(gs, ls, D9, a).phead ∈ gstepf(gs, ls, D9, a).orl ∧ rvownerok(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp) ∧ dom gstepf(gs, ls, D9, a).vrvHp = dom gstepf(gs, ls, D9, a).prvHp ∧ ( gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ≠ null ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs(gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid, gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D9, a).orl.last = gstepf(gs, ls, D9, a).vhead ∧ (gstepf(gs, ls, D9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D9, a).qrl.tail, gstepf(gs, ls, D9, a).vs)) ∨ gstepf(gs, ls, D9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D9, a).orl.butlast.last = gstepf(gs, ls, D9, a).vhead ∧ gstepf(gs, ls, D9, a).phead ≠ gstepf(gs, ls, D9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs)) ∧ ( gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last ∨ gstepf(gs, ls, D9, a).qrl ≠ [] ∧ gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl.butlast).last ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D9, a).vs[(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D9, a).success ∧ gstepf(gs, ls, D9, a).rvowns(gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid)) = Pending(lstepf(gs, ls, D9, a).tid)) ∧ ( lstepf(gs, ls, D9, a).first ∈ gstepf(gs, ls, D9, a).orl ∧ gstepf(gs, ls, D9, a).vhead ∈ gstepf(gs, ls, D9, a).orl from lstepf(gs, ls, D9, a).first) ∧ lstepf(gs, ls, D9, a).lst ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).first ∧ ( gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ gstepf(gs, ls, D9, a).pretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ lstepf(gs, ls, D9, a).rvref ∈ gstepf(gs, ls, D9, a).vrvHp ∧ lstepf(gs, ls, D9, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).vhead, gstepf(gs, ls, D9, a).vs) ∧ noid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vs) ∧ noowns(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).owns)

Lemma step-D9-D10

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

gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, DMSQGInv(gs), DMSQLInv(gs, ls, D9), pre(gs, ls, D9, a), ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D9, a) ∧ pcstepf(gs, ls, D9, a) = D10 → ( gstepf(gs, ls, D9, a).vtail ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).lst ∧ (lstepf(gs, ls, D9, a).nxt ≠ null → lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).vs[lstepf(gs, ls, D9, a).first].next) ∧ ( lstepf(gs, ls, D9, a).first ≠ lstepf(gs, ls, D9, a).lst → lstepf(gs, ls, D9, a).nxt ≠ null ∧ lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).ps[lstepf(gs, ls, D9, a).first].next)) ∧ ( listp(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).ps, gstepf(gs, ls, D9, a).owns) ∧ ¬ dups(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).ps) ∧ markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vs) ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).ps) ∧ gstepf(gs, ls, D9, a).orl ≠ [] ∧ gstepf(gs, ls, D9, a).phead ∈ gstepf(gs, ls, D9, a).orl ∧ rvownerok(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp, gstepf(gs, ls, D9, a).rvowns) ∧ allocrv(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp) ∧ dom gstepf(gs, ls, D9, a).vrvHp = dom gstepf(gs, ls, D9, a).prvHp ∧ ( gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ≠ null ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs(gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid, gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D9, a).orl.last = gstepf(gs, ls, D9, a).vhead ∧ (gstepf(gs, ls, D9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D9, a).qrl.tail, gstepf(gs, ls, D9, a).vs)) ∨ gstepf(gs, ls, D9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D9, a).orl.butlast.last = gstepf(gs, ls, D9, a).vhead ∧ gstepf(gs, ls, D9, a).phead ≠ gstepf(gs, ls, D9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs)) ∧ ( gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last ∨ gstepf(gs, ls, D9, a).qrl ≠ [] ∧ gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl.butlast).last ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D9, a).vs[(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D9, a).success ∧ gstepf(gs, ls, D9, a).rvowns(gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid)) = Pending(lstepf(gs, ls, D9, a).tid)) ∧ ( lstepf(gs, ls, D9, a).first ∈ gstepf(gs, ls, D9, a).orl ∧ gstepf(gs, ls, D9, a).vhead ∈ gstepf(gs, ls, D9, a).orl from lstepf(gs, ls, D9, a).first) ∧ lstepf(gs, ls, D9, a).lst ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).first ∧ ( gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ gstepf(gs, ls, D9, a).pretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref ∧ lstepf(gs, ls, D9, a).rvref ∈ gstepf(gs, ls, D9, a).vrvHp ∧ lstepf(gs, ls, D9, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).vhead, gstepf(gs, ls, D9, a).vs) ∧ noid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vs) ∧ noowns(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, DMSQGInv(gs), DMSQLInv(gs, ls, D9), pre(gs, ls, D9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D9, a) ∧ pcstepf(gs, ls, D9, a) = D10

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, gs.orl ≠ [], DMSQLInv(gs, ls, D9), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D9, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D9, a) ∧ pcstepf(gs, ls, D9, a) = D10, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D9], <all paths>

Additional information

Used simplifier rules: ⊦ D9 ≠ crashed; (s) ⊦ D9 ≠ D32; (s) ⊦ D9 ≠ D33; (s) ⊦ D9 ≠ idle; (s) ⊦ D9 ≠ ready; (s) ⊦ D9 ≠ E1; (s) ⊦ D9 ≠ E17; (s) ⊦ D1 ≠ D9; (s) ⊦ D2 ≠ D9; (s) ⊦ D7 ≠ D9; (s) ⊦ D9 ≠ E4; (s) ⊦ D9 ≠ E16; (s) ⊦ D9 ≠ E15; (s) ⊦ D9 ≠ E14; (s) ⊦ D9 ≠ E13; (s) ⊦ D9 ≠ E12; (s) ⊦ D9 ≠ E11; (s) ⊦ D9 ≠ E10; (s) ⊦ D9 ≠ E9; (s) ⊦ D9 ≠ E8; (s) ⊦ D9 ≠ E7; (s) ⊦ D9 ≠ E6; (s) ⊦ D9 ≠ E5; (s) ⊦ D9 ≠ E3; (s) ⊦ D9 ≠ E2; (s) ⊦ D9 ≠ D34; (s) ⊦ D9 ≠ D31; (s) ⊦ D9 ≠ D30; (s) ⊦ D9 ≠ D29; (s) ⊦ D9 ≠ D28; (s) ⊦ D9 ≠ D27; (s) ⊦ D9 ≠ D26; (s) ⊦ D9 ≠ D25; (s) ⊦ D9 ≠ D24; (s) ⊦ D9 ≠ D23; (s) ⊦ D9 ≠ D22; (s) ⊦ D9 ≠ D21; (s) ⊦ D9 ≠ D20; (s) ⊦ D9 ≠ D19; (s) ⊦ D9 ≠ D18; (s) ⊦ D9 ≠ D17; (s) ⊦ D9 ≠ D16; (s) ⊦ D9 ≠ D15; (s) ⊦ D9 ≠ D14; (s) ⊦ D9 ≠ D13; (s) ⊦ D9 ≠ D12; (s) ⊦ D9 ≠ D11; (s) ⊦ D9 ≠ D10; (s) ⊦ D8 ≠ D9; (s) ⊦ D6 ≠ D9; (s) ⊦ D5 ≠ D9; (s) ⊦ D4 ≠ D9; (s) ⊦ D3 ≠ D9; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, D9, a) = D10; (s) Used terms: gs, ls, D9

Proof step 162 from proof copied-step-DMSQLInv (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 163 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D9, a).pretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref, gstepf(gs, ls, D9, a).rvowns(gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid)) = Pending(lstepf(gs, ls, D9, a).tid), gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref, dom gstepf(gs, ls, D9, a).vrvHp = dom gstepf(gs, ls, D9, a).prvHp, gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, gstepf(gs, ls, D9, a).orl ≠ [], lstepf(gs, ls, D9, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D9), allocrv(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp), allocrv(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp), listp(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).ps, gstepf(gs, ls, D9, a).owns), markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).ps), markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vs), nextnottid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).vhead, gstepf(gs, ls, D9, a).vs), noid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vs), nonullRetRefs (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).pretRefs), noowns(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).owns), pre(gs, ls, D9, a), rvownerok(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp, gstepf(gs, ls, D9, a).rvowns), rvownerok(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp, gstepf(gs, ls, D9, a).rvowns), unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).ps), gstepf(gs, ls, D9, a).vtail ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).lst, gstepf(gs, ls, D9, a).phead ∈ gstepf(gs, ls, D9, a).orl, lstepf(gs, ls, D9, a).first ∈ gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vhead ∈ gstepf(gs, ls, D9, a).orl from lstepf(gs, ls, D9, a).first, lstepf(gs, ls, D9, a).lst ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).first, lstepf(gs, ls, D9, a).rvref ∈ gstepf(gs, ls, D9, a).vrvHp, ¬ lstepf(gs, ls, D9, a).success, ¬ dups(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl), lstepf(gs, ls, D9, a).nxt ≠ null → lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).vs[lstepf(gs, ls, D9, a).first].next, lstepf(gs, ls, D9, a).first ≠ lstepf(gs, ls, D9, a).lst → lstepf(gs, ls, D9, a).nxt ≠ null ∧ lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).ps[lstepf(gs, ls, D9, a).first].next, gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ≠ null ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs(gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid, gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].val), gstepf(gs, ls, D9, a).orl.last = gstepf(gs, ls, D9, a).vhead ∧ (gstepf(gs, ls, D9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D9, a).qrl.tail, gstepf(gs, ls, D9, a).vs)) ∨ gstepf(gs, ls, D9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D9, a).orl.butlast.last = gstepf(gs, ls, D9, a).vhead ∧ gstepf(gs, ls, D9, a).phead ≠ gstepf(gs, ls, D9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs), gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last ∨ gstepf(gs, ls, D9, a).qrl ≠ [] ∧ gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl.butlast).last ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D9, a).vs[(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D9, a).pretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref, gstepf(gs, ls, D9, a).rvowns(gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid)) = Pending(lstepf(gs, ls, D9, a).tid), gstepf(gs, ls, D9, a).vretRefs(lstepf(gs, ls, D9, a).tid) = lstepf(gs, ls, D9, a).rvref, dom gstepf(gs, ls, D9, a).vrvHp = dom gstepf(gs, ls, D9, a).prvHp, gs0 = gstepf(gs, ls, D9, a), ls0 = lstepf(gs, ls, D9, a), pc0 = D10, gstepf(gs, ls, D9, a).orl ≠ [], lstepf(gs, ls, D9, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D9), allocrv(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp), allocrv(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp), listp(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).ps, gstepf(gs, ls, D9, a).owns), markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vs), markedp(gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).ps), nextnottid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).vhead, gstepf(gs, ls, D9, a).vs), noid(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vs), nonullRetRefs (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs, gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).pretRefs), noowns(lstepf(gs, ls, D9, a).tid, gstepf(gs, ls, D9, a).owns), pre(gs, ls, D9, a), rvownerok(gstepf(gs, ls, D9, a).pretRefs, gstepf(gs, ls, D9, a).prvHp, gstepf(gs, ls, D9, a).rvowns), rvownerok(gstepf(gs, ls, D9, a).vretRefs, gstepf(gs, ls, D9, a).vrvHp, gstepf(gs, ls, D9, a).rvowns), unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).ps), lstepf(gs, ls, D9, a).rvref ∈ gstepf(gs, ls, D9, a).vrvHp, lstepf(gs, ls, D9, a).lst ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).first, gstepf(gs, ls, D9, a).vhead ∈ gstepf(gs, ls, D9, a).orl from lstepf(gs, ls, D9, a).first, lstepf(gs, ls, D9, a).first ∈ gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).phead ∈ gstepf(gs, ls, D9, a).orl, gstepf(gs, ls, D9, a).vtail ∈ gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl from lstepf(gs, ls, D9, a).lst, ¬ lstepf(gs, ls, D9, a).success, ¬ dups(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl), gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next ≠ null ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D9, a).rvowns (gstepf(gs, ls, D9, a).vretRefs(gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].deqID.tid, gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).vhead].next].val), lstepf(gs, ls, D9, a).first ≠ lstepf(gs, ls, D9, a).lst → lstepf(gs, ls, D9, a).nxt ≠ null ∧ lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).ps[lstepf(gs, ls, D9, a).first].next, lstepf(gs, ls, D9, a).nxt ≠ null → lstepf(gs, ls, D9, a).nxt = gstepf(gs, ls, D9, a).vs[lstepf(gs, ls, D9, a).first].next, gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last ∨ gstepf(gs, ls, D9, a).qrl ≠ [] ∧ gstepf(gs, ls, D9, a).vtail = (gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl.butlast).last ∧ gstepf(gs, ls, D9, a).vs[gstepf(gs, ls, D9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D9, a).vs[(gstepf(gs, ls, D9, a).orl + gstepf(gs, ls, D9, a).qrl).last].next = null, gstepf(gs, ls, D9, a).orl.last = gstepf(gs, ls, D9, a).vhead ∧ (gstepf(gs, ls, D9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D9, a).qrl.tail, gstepf(gs, ls, D9, a).vs)) ∨ gstepf(gs, ls, D9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D9, a).orl.butlast.last = gstepf(gs, ls, D9, a).vhead ∧ gstepf(gs, ls, D9, a).phead ≠ gstepf(gs, ls, D9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D9, a).qrl, gstepf(gs, ls, D9, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D9, a) ↔ a = (gs.qrl = [] ⊃ checkEmp(ls.tid);τ); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (ls.nxt:= node1).nxt = node1; (s) ⊦ D10 ≠ D11; (s) ⊦ D10 ≠ D12; (s) ⊦ (ls.nxt:= node1).success ↔ ls.success; (s) ⊦ D10 ≠ D13; (s) ⊦ D10 ≠ D14; (s) ⊦ D10 ≠ D15; (s) ⊦ D10 ≠ D18; (s) ⊦ D10 ≠ D19; (s) ⊦ (ls.nxt:= node1).lst = ls.lst; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.nxt:= node1).rvref = ls.rvref; (s) ⊦ D10 ≠ D20; (s) ⊦ D10 ≠ D21; (s) ⊦ D10 ≠ E1; (s) ⊦ D10 ≠ E12; (s) ⊦ D10 ≠ E17; (s) ⊦ D10 ≠ D16; (s) ⊦ D10 ≠ D17; (s) ⊦ D10 ≠ D25; (s) ⊦ D10 ≠ D26; (s) ⊦ D10 ≠ D27; (s) ⊦ D10 ≠ D28; (s) ⊦ D10 ≠ D29; (s) ⊦ D10 ≠ D30; (s) ⊦ D10 ≠ D31; (s) ⊦ D10 ≠ D32; (s) ⊦ D10 ≠ D33; (s) ⊦ D10 ≠ D34; (s) ⊦ (ls.nxt:= node1).first = ls.first; (s) ⊦ D10 ≠ D22; (s) ⊦ D10 ≠ D23; (s) ⊦ D10 ≠ D24; (s) ⊦ D10 ≠ crashed; (s) ⊦ D10 ≠ idle; (s) ⊦ D10 ≠ ready; (s) ⊦ D1 ≠ D10; (s) ⊦ D2 ≠ D10; (s) ⊦ D3 ≠ D10; (s) ⊦ D4 ≠ D10; (s) ⊦ D5 ≠ D10; (s) ⊦ D6 ≠ D10; (s) ⊦ D7 ≠ D10; (s) ⊦ D8 ≠ D10; (s) ⊦ D9 ≠ D10; (s) ⊦ gstepf(gs, ls, D9, a) = gs; (s) ⊦ D10 ≠ E2; (s) ⊦ D10 ≠ E3; (s) ⊦ D10 ≠ E5; (s) ⊦ D10 ≠ E6; (s) ⊦ D10 ≠ E7; (s) ⊦ D10 ≠ E8; (s) ⊦ D10 ≠ E9; (s) ⊦ D10 ≠ E13; (s) ⊦ D10 ≠ E14; (s) ⊦ D10 ≠ E15; (s) ⊦ D10 ≠ E16; (s) ⊦ D10 ≠ E10; (s) ⊦ D10 ≠ E11; (s) ⊦ D10 ≠ E4; (s) ⊦ lstepf(gs, ls, D9, a) = ls.nxt:= (gs.ps ⊕ gs.vs)[ls.first].next; (s) ⊦ (ls.nxt:= node1).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 166 from proof copied-step-DMSQLInv (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 167 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D10, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = pcstepf(gs, ls, D10, a), DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D10, seq: ⊦ pcstepf(gs, ls, D10, a) = (ls.first = gs.vhead ⊃ D11;D33), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D10, a) = (ls.first = gs.vhead ⊃ D11;D33)

A spec-lemma

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

gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = (ls.first = gs.vhead ⊃ D11;D33), DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

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

ls.first = gs.vhead, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D10-D11, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D11 → ( gstepf(gs, ls, D10, a).vtail ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).lst ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl ∧ ( lstepf(gs, ls, D10, a).nxt ≠ null → lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).vs[lstepf(gs, ls, D10, a).first].next) ∧ ( lstepf(gs, ls, D10, a).first ≠ lstepf(gs, ls, D10, a).lst → lstepf(gs, ls, D10, a).nxt ≠ null ∧ lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).ps[lstepf(gs, ls, D10, a).first].next)) ∧ ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok (gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv (gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv (gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs (gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ ( gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = ( gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast ).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D10, a).vs [(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( lstepf(gs, ls, D10, a).first ∈ gstepf(gs, ls, D10, a).orl ∧ gstepf(gs, ls, D10, a).vhead ∈ gstepf(gs, ls, D10, a).orl from lstepf(gs, ls, D10, a).first) ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).first ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D11 → ( gstepf(gs, ls, D10, a).vtail ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).lst ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl ∧ (lstepf(gs, ls, D10, a).nxt ≠ null → lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).vs[lstepf(gs, ls, D10, a).first].next) ∧ ( lstepf(gs, ls, D10, a).first ≠ lstepf(gs, ls, D10, a).lst → lstepf(gs, ls, D10, a).nxt ≠ null ∧ lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).ps[lstepf(gs, ls, D10, a).first].next)) ∧ ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( lstepf(gs, ls, D10, a).first ∈ gstepf(gs, ls, D10, a).orl ∧ gstepf(gs, ls, D10, a).vhead ∈ gstepf(gs, ls, D10, a).orl from lstepf(gs, ls, D10, a).first) ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).first ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns)

Lemma step-D10-D11

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

ls.first = gs.vhead, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D11 → ( gstepf(gs, ls, D10, a).vtail ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).lst ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl ∧ (lstepf(gs, ls, D10, a).nxt ≠ null → lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).vs[lstepf(gs, ls, D10, a).first].next) ∧ ( lstepf(gs, ls, D10, a).first ≠ lstepf(gs, ls, D10, a).lst → lstepf(gs, ls, D10, a).nxt ≠ null ∧ lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).ps[lstepf(gs, ls, D10, a).first].next)) ∧ ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( lstepf(gs, ls, D10, a).first ∈ gstepf(gs, ls, D10, a).orl ∧ gstepf(gs, ls, D10, a).vhead ∈ gstepf(gs, ls, D10, a).orl from lstepf(gs, ls, D10, a).first) ∧ lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).first ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

ls.first = gs.vhead, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D11

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

ls.first = gs.vhead, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, gs.orl ≠ [], DMSQLInv(gs, ls, D10), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D10, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D11, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D10], <all paths>

Additional information

Used simplifier rules: ⊦ D10 ≠ crashed; (s) ⊦ D10 ≠ D32; (s) ⊦ D10 ≠ D33; (s) ⊦ D10 ≠ idle; (s) ⊦ D10 ≠ ready; (s) ⊦ D10 ≠ E1; (s) ⊦ D10 ≠ E17; (s) ⊦ D1 ≠ D10; (s) ⊦ D2 ≠ D10; (s) ⊦ D7 ≠ D10; (s) ⊦ D10 ≠ E4; (s) ⊦ D10 ≠ E16; (s) ⊦ D10 ≠ E15; (s) ⊦ D10 ≠ E14; (s) ⊦ D10 ≠ E13; (s) ⊦ D10 ≠ E12; (s) ⊦ D10 ≠ E11; (s) ⊦ D10 ≠ E10; (s) ⊦ D10 ≠ E9; (s) ⊦ D10 ≠ E8; (s) ⊦ D10 ≠ E7; (s) ⊦ D10 ≠ E6; (s) ⊦ D10 ≠ E5; (s) ⊦ D10 ≠ E3; (s) ⊦ D10 ≠ E2; (s) ⊦ D10 ≠ D34; (s) ⊦ D10 ≠ D31; (s) ⊦ D10 ≠ D30; (s) ⊦ D10 ≠ D29; (s) ⊦ D10 ≠ D28; (s) ⊦ D10 ≠ D27; (s) ⊦ D10 ≠ D26; (s) ⊦ D10 ≠ D25; (s) ⊦ D10 ≠ D24; (s) ⊦ D10 ≠ D23; (s) ⊦ D10 ≠ D22; (s) ⊦ D10 ≠ D21; (s) ⊦ D10 ≠ D20; (s) ⊦ D10 ≠ D19; (s) ⊦ D10 ≠ D18; (s) ⊦ D10 ≠ D17; (s) ⊦ D10 ≠ D16; (s) ⊦ D10 ≠ D15; (s) ⊦ D10 ≠ D14; (s) ⊦ D10 ≠ D13; (s) ⊦ D10 ≠ D12; (s) ⊦ D10 ≠ D11; (s) ⊦ D9 ≠ D10; (s) ⊦ D8 ≠ D10; (s) ⊦ D6 ≠ D10; (s) ⊦ D5 ≠ D10; (s) ⊦ D4 ≠ D10; (s) ⊦ D3 ≠ D10; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D10, a) = (ls.first = gs.vhead ⊃ D11;D33); (s) Used terms: gs, ls, D10

Proof step 177 from proof copied-step-DMSQLInv (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 178 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.first = gs.vhead, gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid), gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, gstepf(gs, ls, D10, a).orl ≠ [], lstepf(gs, ls, D10, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D10), allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp), allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp), listp(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs), nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vs), nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs), noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), pre(gs, ls, D10, a), rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns), rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns), unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps), gstepf(gs, ls, D10, a).vtail ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).lst, lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl, lstepf(gs, ls, D10, a).first ∈ gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vhead ∈ gstepf(gs, ls, D10, a).orl from lstepf(gs, ls, D10, a).first, lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).first, lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp, ¬ lstepf(gs, ls, D10, a).success, ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl), lstepf(gs, ls, D10, a).nxt ≠ null → lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).vs[lstepf(gs, ls, D10, a).first].next, lstepf(gs, ls, D10, a).first ≠ lstepf(gs, ls, D10, a).lst → lstepf(gs, ls, D10, a).nxt ≠ null ∧ lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).ps[lstepf(gs, ls, D10, a).first].next, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val), gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs), gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

ls.first = gs.vhead, gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid), gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D11, gstepf(gs, ls, D10, a).orl ≠ [], lstepf(gs, ls, D10, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D10), allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp), allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp), listp(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps), nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vs), nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs), noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), pre(gs, ls, D10, a), rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns), rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns), unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps), lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp, lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).first, gstepf(gs, ls, D10, a).vhead ∈ gstepf(gs, ls, D10, a).orl from lstepf(gs, ls, D10, a).first, lstepf(gs, ls, D10, a).first ∈ gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl, lstepf(gs, ls, D10, a).lst ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vtail ∈ gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl from lstepf(gs, ls, D10, a).lst, ¬ lstepf(gs, ls, D10, a).success, ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl), gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val), lstepf(gs, ls, D10, a).first ≠ lstepf(gs, ls, D10, a).lst → lstepf(gs, ls, D10, a).nxt ≠ null ∧ lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).ps[lstepf(gs, ls, D10, a).first].next, lstepf(gs, ls, D10, a).nxt ≠ null → lstepf(gs, ls, D10, a).nxt = gstepf(gs, ls, D10, a).vs[lstepf(gs, ls, D10, a).first].next, gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null, gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D11 ≠ D12; (s) ⊦ D11 ≠ D13; (s) ⊦ D11 ≠ D14; (s) ⊦ D11 ≠ D15; (s) ⊦ D11 ≠ D18; (s) ⊦ D11 ≠ D19; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D11 ≠ D20; (s) ⊦ D11 ≠ D21; (s) ⊦ D11 ≠ E1; (s) ⊦ D11 ≠ E12; (s) ⊦ D11 ≠ E17; (s) ⊦ D11 ≠ D16; (s) ⊦ D11 ≠ D17; (s) ⊦ D11 ≠ D25; (s) ⊦ D11 ≠ D26; (s) ⊦ D11 ≠ D27; (s) ⊦ D11 ≠ D28; (s) ⊦ D11 ≠ D29; (s) ⊦ D11 ≠ D30; (s) ⊦ D11 ≠ D31; (s) ⊦ D11 ≠ D32; (s) ⊦ D11 ≠ D33; (s) ⊦ D11 ≠ D34; (s) ⊦ D11 ≠ D22; (s) ⊦ D11 ≠ D23; (s) ⊦ D11 ≠ D24; (s) ⊦ D11 ≠ crashed; (s) ⊦ D11 ≠ idle; (s) ⊦ D11 ≠ ready; (s) ⊦ D1 ≠ D11; (s) ⊦ D2 ≠ D11; (s) ⊦ D3 ≠ D11; (s) ⊦ D4 ≠ D11; (s) ⊦ D5 ≠ D11; (s) ⊦ D6 ≠ D11; (s) ⊦ D7 ≠ D11; (s) ⊦ D8 ≠ D11; (s) ⊦ D9 ≠ D11; (s) ⊦ D10 ≠ D11; (s) ⊦ D11 ≠ E2; (s) ⊦ D11 ≠ E3; (s) ⊦ D11 ≠ E5; (s) ⊦ D11 ≠ E6; (s) ⊦ D11 ≠ E7; (s) ⊦ D11 ≠ E8; (s) ⊦ D11 ≠ E9; (s) ⊦ D11 ≠ E13; (s) ⊦ D11 ≠ E14; (s) ⊦ D11 ≠ E15; (s) ⊦ D11 ≠ E16; (s) ⊦ D11 ≠ E10; (s) ⊦ D11 ≠ E11; (s) ⊦ D11 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D10, τ) = gs; (s) ⊦ lstepf(gs, ls, D10, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 181 from proof copied-step-DMSQLInv (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 182 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D10-D33, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D33 → ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok (gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv (gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv (gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs (gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D10, a).vs [gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ ( gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = ( gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast ).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D10, a).vs [(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D33 → ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid (lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns)

Lemma step-D10-D33

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

gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D33 → ( listp (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns) ∧ ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps) ∧ markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs) ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps) ∧ gstepf(gs, ls, D10, a).orl ≠ [] ∧ gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl ∧ rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns) ∧ allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp) ∧ dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp ∧ ( gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs)) ∧ ( gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D10, a).success ∧ gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid)) ∧ ( gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref ∧ lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp ∧ lstepf(gs, ls, D10, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs) ∧ noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, DMSQGInv(gs), DMSQLInv(gs, ls, D10), pre(gs, ls, D10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D33

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, gs.orl ≠ [], DMSQLInv(gs, ls, D10), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D10, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D10, a) ∧ pcstepf(gs, ls, D10, a) = D33, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D10], <all paths>

Additional information

Used simplifier rules: ⊦ D10 ≠ crashed; (s) ⊦ D10 ≠ D32; (s) ⊦ D10 ≠ D33; (s) ⊦ D10 ≠ idle; (s) ⊦ D10 ≠ ready; (s) ⊦ D10 ≠ E1; (s) ⊦ D10 ≠ E17; (s) ⊦ D1 ≠ D10; (s) ⊦ D2 ≠ D10; (s) ⊦ D7 ≠ D10; (s) ⊦ D10 ≠ E4; (s) ⊦ D10 ≠ E16; (s) ⊦ D10 ≠ E15; (s) ⊦ D10 ≠ E14; (s) ⊦ D10 ≠ E13; (s) ⊦ D10 ≠ E12; (s) ⊦ D10 ≠ E11; (s) ⊦ D10 ≠ E10; (s) ⊦ D10 ≠ E9; (s) ⊦ D10 ≠ E8; (s) ⊦ D10 ≠ E7; (s) ⊦ D10 ≠ E6; (s) ⊦ D10 ≠ E5; (s) ⊦ D10 ≠ E3; (s) ⊦ D10 ≠ E2; (s) ⊦ D10 ≠ D34; (s) ⊦ D10 ≠ D31; (s) ⊦ D10 ≠ D30; (s) ⊦ D10 ≠ D29; (s) ⊦ D10 ≠ D28; (s) ⊦ D10 ≠ D27; (s) ⊦ D10 ≠ D26; (s) ⊦ D10 ≠ D25; (s) ⊦ D10 ≠ D24; (s) ⊦ D10 ≠ D23; (s) ⊦ D10 ≠ D22; (s) ⊦ D10 ≠ D21; (s) ⊦ D10 ≠ D20; (s) ⊦ D10 ≠ D19; (s) ⊦ D10 ≠ D18; (s) ⊦ D10 ≠ D17; (s) ⊦ D10 ≠ D16; (s) ⊦ D10 ≠ D15; (s) ⊦ D10 ≠ D14; (s) ⊦ D10 ≠ D13; (s) ⊦ D10 ≠ D12; (s) ⊦ D10 ≠ D11; (s) ⊦ D9 ≠ D10; (s) ⊦ D8 ≠ D10; (s) ⊦ D6 ≠ D10; (s) ⊦ D5 ≠ D10; (s) ⊦ D4 ≠ D10; (s) ⊦ D3 ≠ D10; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D10, a) = (ls.first = gs.vhead ⊃ D11;D33); (s) Used terms: gs, ls, D10

Proof step 188 from proof copied-step-DMSQLInv (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 189 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid), gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, gstepf(gs, ls, D10, a).orl ≠ [], lstepf(gs, ls, D10, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D10), allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp), allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp), listp(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs), nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs), noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), pre(gs, ls, D10, a), rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns), rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns), unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps), gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl, lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp, ¬ lstepf(gs, ls, D10, a).success, ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl), gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val), gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs), gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D10, a).pretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, gstepf(gs, ls, D10, a).rvowns(gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid)) = Pending(lstepf(gs, ls, D10, a).tid), gstepf(gs, ls, D10, a).vretRefs(lstepf(gs, ls, D10, a).tid) = lstepf(gs, ls, D10, a).rvref, dom gstepf(gs, ls, D10, a).vrvHp = dom gstepf(gs, ls, D10, a).prvHp, gs0 = gstepf(gs, ls, D10, a), ls0 = lstepf(gs, ls, D10, a), pc0 = D33, ls.first ≠ gs.vhead, gstepf(gs, ls, D10, a).orl ≠ [], lstepf(gs, ls, D10, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D10), allocrv(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp), allocrv(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp), listp(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).ps, gstepf(gs, ls, D10, a).owns), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).vs), markedp(gstepf(gs, ls, D10, a).orl, gstepf(gs, ls, D10, a).ps), nextnottid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), noid(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vhead, gstepf(gs, ls, D10, a).vs), nonullRetRefs (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs, gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).pretRefs), noowns(lstepf(gs, ls, D10, a).tid, gstepf(gs, ls, D10, a).owns), pre(gs, ls, D10, a), rvownerok(gstepf(gs, ls, D10, a).pretRefs, gstepf(gs, ls, D10, a).prvHp, gstepf(gs, ls, D10, a).rvowns), rvownerok(gstepf(gs, ls, D10, a).vretRefs, gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).rvowns), unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).ps), lstepf(gs, ls, D10, a).rvref ∈ gstepf(gs, ls, D10, a).vrvHp, gstepf(gs, ls, D10, a).phead ∈ gstepf(gs, ls, D10, a).orl, ¬ lstepf(gs, ls, D10, a).success, ¬ dups(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl), gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next ≠ null ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D10, a).rvowns (gstepf(gs, ls, D10, a).vretRefs(gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].deqID.tid, gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).vhead].next].val), gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last ∨ gstepf(gs, ls, D10, a).qrl ≠ [] ∧ gstepf(gs, ls, D10, a).vtail = (gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl.butlast).last ∧ gstepf(gs, ls, D10, a).vs[gstepf(gs, ls, D10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D10, a).vs[(gstepf(gs, ls, D10, a).orl + gstepf(gs, ls, D10, a).qrl).last].next = null, gstepf(gs, ls, D10, a).orl.last = gstepf(gs, ls, D10, a).vhead ∧ (gstepf(gs, ls, D10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D10, a).qrl.tail, gstepf(gs, ls, D10, a).vs)) ∨ gstepf(gs, ls, D10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D10, a).orl.butlast.last = gstepf(gs, ls, D10, a).vhead ∧ gstepf(gs, ls, D10, a).phead ≠ gstepf(gs, ls, D10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D10, a).qrl, gstepf(gs, ls, D10, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D10, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D33 ≠ D34; (s) ⊦ D33 ≠ E1; (s) ⊦ D33 ≠ E12; (s) ⊦ D33 ≠ E17; (s) ⊦ D33 ≠ crashed; (s) ⊦ D33 ≠ idle; (s) ⊦ D33 ≠ ready; (s) ⊦ D1 ≠ D33; (s) ⊦ D2 ≠ D33; (s) ⊦ D3 ≠ D33; (s) ⊦ D4 ≠ D33; (s) ⊦ D5 ≠ D33; (s) ⊦ D6 ≠ D33; (s) ⊦ D7 ≠ D33; (s) ⊦ D8 ≠ D33; (s) ⊦ D9 ≠ D33; (s) ⊦ D10 ≠ D33; (s) ⊦ D11 ≠ D33; (s) ⊦ D12 ≠ D33; (s) ⊦ D13 ≠ D33; (s) ⊦ D14 ≠ D33; (s) ⊦ D15 ≠ D33; (s) ⊦ D16 ≠ D33; (s) ⊦ D17 ≠ D33; (s) ⊦ D18 ≠ D33; (s) ⊦ D19 ≠ D33; (s) ⊦ D20 ≠ D33; (s) ⊦ D21 ≠ D33; (s) ⊦ D22 ≠ D33; (s) ⊦ D23 ≠ D33; (s) ⊦ D24 ≠ D33; (s) ⊦ D25 ≠ D33; (s) ⊦ D26 ≠ D33; (s) ⊦ D27 ≠ D33; (s) ⊦ D28 ≠ D33; (s) ⊦ D29 ≠ D33; (s) ⊦ D30 ≠ D33; (s) ⊦ D31 ≠ D33; (s) ⊦ D32 ≠ D33; (s) ⊦ D33 ≠ E2; (s) ⊦ D33 ≠ E3; (s) ⊦ D33 ≠ E5; (s) ⊦ D33 ≠ E6; (s) ⊦ D33 ≠ E7; (s) ⊦ D33 ≠ E8; (s) ⊦ D33 ≠ E9; (s) ⊦ D33 ≠ E13; (s) ⊦ D33 ≠ E14; (s) ⊦ D33 ≠ E15; (s) ⊦ D33 ≠ E16; (s) ⊦ D33 ≠ E10; (s) ⊦ D33 ≠ E11; (s) ⊦ D33 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D10, τ) = gs; (s) ⊦ lstepf(gs, ls, D10, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 192 from proof copied-step-DMSQLInv (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 193 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D11, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = pcstepf(gs, ls, D11, a), DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D11, seq: ⊦ pcstepf(gs, ls, D11, a) = (ls.first = ls.lst ⊃ D12;D18), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D11, a) = (ls.first = ls.lst ⊃ D12;D18)

A spec-lemma

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

gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = (ls.first = ls.lst ⊃ D12;D18), DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

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

ls.first = ls.lst, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D11-D12, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D12 → ( lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl ∧ ( lstepf(gs, ls, D11, a).nxt ≠ null → lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).vs[lstepf(gs, ls, D11, a).lst].next)) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok (gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv (gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv (gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs (gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ ( gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = ( gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast ).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D11, a).vs [(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D12 → ( lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl ∧ (lstepf(gs, ls, D11, a).nxt ≠ null → lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).vs[lstepf(gs, ls, D11, a).lst].next)) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns)

Lemma step-D11-D12

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

ls.first = ls.lst, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D12 → ( lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl ∧ (lstepf(gs, ls, D11, a).nxt ≠ null → lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).vs[lstepf(gs, ls, D11, a).lst].next)) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

ls.first = ls.lst, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D12

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

ls.first = ls.lst, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, gs.orl ≠ [], DMSQLInv(gs, ls, D11), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D11, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D12, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D11], <all paths>

Additional information

Used simplifier rules: ⊦ D11 ≠ crashed; (s) ⊦ D11 ≠ D32; (s) ⊦ D11 ≠ D33; (s) ⊦ D11 ≠ idle; (s) ⊦ D11 ≠ ready; (s) ⊦ D11 ≠ E1; (s) ⊦ D11 ≠ E17; (s) ⊦ D1 ≠ D11; (s) ⊦ D2 ≠ D11; (s) ⊦ D7 ≠ D11; (s) ⊦ D11 ≠ E4; (s) ⊦ D11 ≠ E16; (s) ⊦ D11 ≠ E15; (s) ⊦ D11 ≠ E14; (s) ⊦ D11 ≠ E13; (s) ⊦ D11 ≠ E12; (s) ⊦ D11 ≠ E11; (s) ⊦ D11 ≠ E10; (s) ⊦ D11 ≠ E9; (s) ⊦ D11 ≠ E8; (s) ⊦ D11 ≠ E7; (s) ⊦ D11 ≠ E6; (s) ⊦ D11 ≠ E5; (s) ⊦ D11 ≠ E3; (s) ⊦ D11 ≠ E2; (s) ⊦ D11 ≠ D34; (s) ⊦ D11 ≠ D31; (s) ⊦ D11 ≠ D30; (s) ⊦ D11 ≠ D29; (s) ⊦ D11 ≠ D28; (s) ⊦ D11 ≠ D27; (s) ⊦ D11 ≠ D26; (s) ⊦ D11 ≠ D25; (s) ⊦ D11 ≠ D24; (s) ⊦ D11 ≠ D23; (s) ⊦ D11 ≠ D22; (s) ⊦ D11 ≠ D21; (s) ⊦ D11 ≠ D20; (s) ⊦ D11 ≠ D19; (s) ⊦ D11 ≠ D18; (s) ⊦ D11 ≠ D17; (s) ⊦ D11 ≠ D16; (s) ⊦ D11 ≠ D15; (s) ⊦ D11 ≠ D14; (s) ⊦ D11 ≠ D13; (s) ⊦ D11 ≠ D12; (s) ⊦ D10 ≠ D11; (s) ⊦ D9 ≠ D11; (s) ⊦ D8 ≠ D11; (s) ⊦ D6 ≠ D11; (s) ⊦ D5 ≠ D11; (s) ⊦ D4 ≠ D11; (s) ⊦ D3 ≠ D11; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D11, a) = (ls.first = ls.lst ⊃ D12;D18); (s) Used terms: gs, ls, D11

Proof step 203 from proof copied-step-DMSQLInv (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 204 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.first = ls.lst, gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid), gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, gstepf(gs, ls, D11, a).orl ≠ [], lstepf(gs, ls, D11, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D11), allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp), allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp), listp(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs), nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs), noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs), nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs), noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), pre(gs, ls, D11, a), rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns), rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns), unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps), lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl, lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first, lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp, ¬ lstepf(gs, ls, D11, a).success, ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl), lstepf(gs, ls, D11, a).nxt ≠ null → lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).vs[lstepf(gs, ls, D11, a).lst].next, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val), gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs), gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

ls.first = ls.lst, gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid), gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D12, gstepf(gs, ls, D11, a).orl ≠ [], lstepf(gs, ls, D11, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D11), allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp), allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp), listp(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps), nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs), noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs), nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs), noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), pre(gs, ls, D11, a), rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns), rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns), unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps), lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first, lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl, lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, ¬ lstepf(gs, ls, D11, a).success, ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl), gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val), lstepf(gs, ls, D11, a).nxt ≠ null → lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).vs[lstepf(gs, ls, D11, a).lst].next, gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null, gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D12 ≠ D13; (s) ⊦ D12 ≠ D14; (s) ⊦ D12 ≠ D15; (s) ⊦ D12 ≠ D18; (s) ⊦ D12 ≠ D19; (s) ⊦ D12 ≠ D20; (s) ⊦ D12 ≠ D21; (s) ⊦ D12 ≠ E1; (s) ⊦ D12 ≠ E12; (s) ⊦ D12 ≠ E17; (s) ⊦ D12 ≠ D16; (s) ⊦ D12 ≠ D17; (s) ⊦ D12 ≠ D25; (s) ⊦ D12 ≠ D26; (s) ⊦ D12 ≠ D27; (s) ⊦ D12 ≠ D28; (s) ⊦ D12 ≠ D29; (s) ⊦ D12 ≠ D30; (s) ⊦ D12 ≠ D31; (s) ⊦ D12 ≠ D32; (s) ⊦ D12 ≠ D33; (s) ⊦ D12 ≠ D34; (s) ⊦ D12 ≠ D22; (s) ⊦ D12 ≠ D23; (s) ⊦ D12 ≠ D24; (s) ⊦ D12 ≠ crashed; (s) ⊦ D12 ≠ idle; (s) ⊦ D12 ≠ ready; (s) ⊦ D1 ≠ D12; (s) ⊦ D2 ≠ D12; (s) ⊦ D3 ≠ D12; (s) ⊦ D4 ≠ D12; (s) ⊦ D5 ≠ D12; (s) ⊦ D6 ≠ D12; (s) ⊦ D7 ≠ D12; (s) ⊦ D8 ≠ D12; (s) ⊦ D9 ≠ D12; (s) ⊦ D10 ≠ D12; (s) ⊦ D11 ≠ D12; (s) ⊦ D12 ≠ E2; (s) ⊦ D12 ≠ E3; (s) ⊦ D12 ≠ E5; (s) ⊦ D12 ≠ E6; (s) ⊦ D12 ≠ E7; (s) ⊦ D12 ≠ E8; (s) ⊦ D12 ≠ E9; (s) ⊦ D12 ≠ E13; (s) ⊦ D12 ≠ E14; (s) ⊦ D12 ≠ E15; (s) ⊦ D12 ≠ E16; (s) ⊦ D12 ≠ E10; (s) ⊦ D12 ≠ E11; (s) ⊦ D12 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D11, τ) = gs; (s) ⊦ lstepf(gs, ls, D11, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 207 from proof copied-step-DMSQLInv (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 208 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, ls.first ≠ ls.lst, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D11-D18, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D18 → ( lstepf(gs, ls, D11, a).nxt ≠ null ∧ lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).ps[lstepf(gs, ls, D11, a).first].next) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok (gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv (gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv (gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs (gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D11, a).vs [gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ ( gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = ( gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast ).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D11, a).vs [(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( lstepf(gs, ls, D11, a).first ≠ lstepf(gs, ls, D11, a).lst ∧ gstepf(gs, ls, D11, a).vtail ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).lst) ∧ lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).first ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

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

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D18 → (lstepf(gs, ls, D11, a).nxt ≠ null ∧ lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).ps[lstepf(gs, ls, D11, a).first].next) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( lstepf(gs, ls, D11, a).first ≠ lstepf(gs, ls, D11, a).lst ∧ gstepf(gs, ls, D11, a).vtail ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).lst) ∧ lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).first ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid (lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns)

Lemma step-D11-D18

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

gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, ls.first ≠ ls.lst, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D18 → (lstepf(gs, ls, D11, a).nxt ≠ null ∧ lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).ps[lstepf(gs, ls, D11, a).first].next) ∧ ( listp (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns) ∧ ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps) ∧ markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs) ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps) ∧ gstepf(gs, ls, D11, a).orl ≠ [] ∧ gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl ∧ rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns) ∧ allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp) ∧ dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp ∧ ( gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs)) ∧ ( gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D11, a).success ∧ gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid)) ∧ ( lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl ∧ gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first) ∧ ( lstepf(gs, ls, D11, a).first ≠ lstepf(gs, ls, D11, a).lst ∧ gstepf(gs, ls, D11, a).vtail ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).lst) ∧ lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).first ∧ ( gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref ∧ lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp ∧ lstepf(gs, ls, D11, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs) ∧ noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs) ∧ noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, ls.first ≠ ls.lst, DMSQGInv(gs), DMSQLInv(gs, ls, D11), pre(gs, ls, D11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D18

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, ls.first ≠ ls.lst, gs.orl ≠ [], DMSQLInv(gs, ls, D11), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D11, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D11, a) ∧ pcstepf(gs, ls, D11, a) = D18, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D11], <all paths>

Additional information

Used simplifier rules: ⊦ D11 ≠ crashed; (s) ⊦ D11 ≠ D32; (s) ⊦ D11 ≠ D33; (s) ⊦ D11 ≠ idle; (s) ⊦ D11 ≠ ready; (s) ⊦ D11 ≠ E1; (s) ⊦ D11 ≠ E17; (s) ⊦ D1 ≠ D11; (s) ⊦ D2 ≠ D11; (s) ⊦ D7 ≠ D11; (s) ⊦ D11 ≠ E4; (s) ⊦ D11 ≠ E16; (s) ⊦ D11 ≠ E15; (s) ⊦ D11 ≠ E14; (s) ⊦ D11 ≠ E13; (s) ⊦ D11 ≠ E12; (s) ⊦ D11 ≠ E11; (s) ⊦ D11 ≠ E10; (s) ⊦ D11 ≠ E9; (s) ⊦ D11 ≠ E8; (s) ⊦ D11 ≠ E7; (s) ⊦ D11 ≠ E6; (s) ⊦ D11 ≠ E5; (s) ⊦ D11 ≠ E3; (s) ⊦ D11 ≠ E2; (s) ⊦ D11 ≠ D34; (s) ⊦ D11 ≠ D31; (s) ⊦ D11 ≠ D30; (s) ⊦ D11 ≠ D29; (s) ⊦ D11 ≠ D28; (s) ⊦ D11 ≠ D27; (s) ⊦ D11 ≠ D26; (s) ⊦ D11 ≠ D25; (s) ⊦ D11 ≠ D24; (s) ⊦ D11 ≠ D23; (s) ⊦ D11 ≠ D22; (s) ⊦ D11 ≠ D21; (s) ⊦ D11 ≠ D20; (s) ⊦ D11 ≠ D19; (s) ⊦ D11 ≠ D18; (s) ⊦ D11 ≠ D17; (s) ⊦ D11 ≠ D16; (s) ⊦ D11 ≠ D15; (s) ⊦ D11 ≠ D14; (s) ⊦ D11 ≠ D13; (s) ⊦ D11 ≠ D12; (s) ⊦ D10 ≠ D11; (s) ⊦ D9 ≠ D11; (s) ⊦ D8 ≠ D11; (s) ⊦ D6 ≠ D11; (s) ⊦ D5 ≠ D11; (s) ⊦ D4 ≠ D11; (s) ⊦ D3 ≠ D11; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D11, a) = (ls.first = ls.lst ⊃ D12;D18); (s) Used terms: gs, ls, D11

Proof step 214 from proof copied-step-DMSQLInv (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 215 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).ps[lstepf(gs, ls, D11, a).first].next, gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid), gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, lstepf(gs, ls, D11, a).first ≠ lstepf(gs, ls, D11, a).lst, ls.first ≠ ls.lst, lstepf(gs, ls, D11, a).nxt ≠ null, gstepf(gs, ls, D11, a).orl ≠ [], lstepf(gs, ls, D11, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D11), allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp), allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp), listp(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs), nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs), noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs), nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs), noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), pre(gs, ls, D11, a), rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns), rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns), unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps), gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl, lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vtail ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).lst, lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).first, lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp, ¬ lstepf(gs, ls, D11, a).success, ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl), gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val), gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs), gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

lstepf(gs, ls, D11, a).nxt = gstepf(gs, ls, D11, a).ps[lstepf(gs, ls, D11, a).first].next, gstepf(gs, ls, D11, a).pretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, gstepf(gs, ls, D11, a).rvowns(gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid)) = Pending(lstepf(gs, ls, D11, a).tid), gstepf(gs, ls, D11, a).vretRefs(lstepf(gs, ls, D11, a).tid) = lstepf(gs, ls, D11, a).rvref, dom gstepf(gs, ls, D11, a).vrvHp = dom gstepf(gs, ls, D11, a).prvHp, gs0 = gstepf(gs, ls, D11, a), ls0 = lstepf(gs, ls, D11, a), pc0 = D18, lstepf(gs, ls, D11, a).first ≠ lstepf(gs, ls, D11, a).lst, ls.first ≠ ls.lst, lstepf(gs, ls, D11, a).nxt ≠ null, gstepf(gs, ls, D11, a).orl ≠ [], lstepf(gs, ls, D11, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D11), allocrv(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp), allocrv(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp), listp(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).ps, gstepf(gs, ls, D11, a).owns), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).vs), markedp(gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).ps), nextnottid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).vhead, gstepf(gs, ls, D11, a).vs), noid(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vs), nonullRetRefs (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs, gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).pretRefs), noowns(lstepf(gs, ls, D11, a).tid, gstepf(gs, ls, D11, a).owns), pre(gs, ls, D11, a), rvownerok(gstepf(gs, ls, D11, a).pretRefs, gstepf(gs, ls, D11, a).prvHp, gstepf(gs, ls, D11, a).rvowns), rvownerok(gstepf(gs, ls, D11, a).vretRefs, gstepf(gs, ls, D11, a).vrvHp, gstepf(gs, ls, D11, a).rvowns), unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).ps), lstepf(gs, ls, D11, a).rvref ∈ gstepf(gs, ls, D11, a).vrvHp, lstepf(gs, ls, D11, a).lst ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).first, gstepf(gs, ls, D11, a).vtail ∈ gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl from lstepf(gs, ls, D11, a).lst, gstepf(gs, ls, D11, a).vhead ∈ gstepf(gs, ls, D11, a).orl from lstepf(gs, ls, D11, a).first, lstepf(gs, ls, D11, a).first ∈ gstepf(gs, ls, D11, a).orl, gstepf(gs, ls, D11, a).phead ∈ gstepf(gs, ls, D11, a).orl, ¬ lstepf(gs, ls, D11, a).success, ¬ dups(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl), gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next ≠ null ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D11, a).rvowns (gstepf(gs, ls, D11, a).vretRefs(gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].deqID.tid, gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).vhead].next].val), gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last ∨ gstepf(gs, ls, D11, a).qrl ≠ [] ∧ gstepf(gs, ls, D11, a).vtail = (gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl.butlast).last ∧ gstepf(gs, ls, D11, a).vs[gstepf(gs, ls, D11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D11, a).vs[(gstepf(gs, ls, D11, a).orl + gstepf(gs, ls, D11, a).qrl).last].next = null, gstepf(gs, ls, D11, a).orl.last = gstepf(gs, ls, D11, a).vhead ∧ (gstepf(gs, ls, D11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D11, a).qrl.tail, gstepf(gs, ls, D11, a).vs)) ∨ gstepf(gs, ls, D11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D11, a).orl.butlast.last = gstepf(gs, ls, D11, a).vhead ∧ gstepf(gs, ls, D11, a).phead ≠ gstepf(gs, ls, D11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D11, a).qrl, gstepf(gs, ls, D11, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D11, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D18 ≠ D19; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D18 ≠ D20; (s) ⊦ D18 ≠ D21; (s) ⊦ D18 ≠ E1; (s) ⊦ D18 ≠ E12; (s) ⊦ D18 ≠ E17; (s) ⊦ D18 ≠ D25; (s) ⊦ D18 ≠ D26; (s) ⊦ D18 ≠ D27; (s) ⊦ D18 ≠ D28; (s) ⊦ D18 ≠ D29; (s) ⊦ D18 ≠ D30; (s) ⊦ D18 ≠ D31; (s) ⊦ D18 ≠ D32; (s) ⊦ D18 ≠ D33; (s) ⊦ D18 ≠ D34; (s) ⊦ D18 ≠ D22; (s) ⊦ D18 ≠ D23; (s) ⊦ D18 ≠ D24; (s) ⊦ D18 ≠ crashed; (s) ⊦ D18 ≠ idle; (s) ⊦ D18 ≠ ready; (s) ⊦ D1 ≠ D18; (s) ⊦ D2 ≠ D18; (s) ⊦ D3 ≠ D18; (s) ⊦ D4 ≠ D18; (s) ⊦ D5 ≠ D18; (s) ⊦ D6 ≠ D18; (s) ⊦ D7 ≠ D18; (s) ⊦ D8 ≠ D18; (s) ⊦ D9 ≠ D18; (s) ⊦ D10 ≠ D18; (s) ⊦ D11 ≠ D18; (s) ⊦ D12 ≠ D18; (s) ⊦ D13 ≠ D18; (s) ⊦ D14 ≠ D18; (s) ⊦ D15 ≠ D18; (s) ⊦ D16 ≠ D18; (s) ⊦ D17 ≠ D18; (s) ⊦ D18 ≠ E2; (s) ⊦ D18 ≠ E3; (s) ⊦ D18 ≠ E5; (s) ⊦ D18 ≠ E6; (s) ⊦ D18 ≠ E7; (s) ⊦ D18 ≠ E8; (s) ⊦ D18 ≠ E9; (s) ⊦ D18 ≠ E13; (s) ⊦ D18 ≠ E14; (s) ⊦ D18 ≠ E15; (s) ⊦ D18 ≠ E16; (s) ⊦ D18 ≠ E10; (s) ⊦ D18 ≠ E11; (s) ⊦ D18 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D11, τ) = gs; (s) ⊦ lstepf(gs, ls, D11, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 218 from proof copied-step-DMSQLInv (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 219 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D12, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = pcstepf(gs, ls, D12, a), DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D12, seq: ⊦ pcstepf(gs, ls, D12, a) = (ls.nxt = null ⊃ D13;D16), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D12, a) = (ls.nxt = null ⊃ D13;D16)

A spec-lemma

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

gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = (ls.nxt = null ⊃ D13;D16), DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

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

ls.nxt = null, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D12-D13, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D13 → ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok (gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv (gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv (gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs (gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ ( gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = ( gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast ).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D12, a).vs [(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( lstepf(gs, ls, D12, a).first ∈ gstepf(gs, ls, D12, a).orl ∧ gstepf(gs, ls, D12, a).vhead ∈ gstepf(gs, ls, D12, a).orl from lstepf(gs, ls, D12, a).first) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, lstepf(gs, ls, D12, a).first, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D13 → (lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( lstepf(gs, ls, D12, a).first ∈ gstepf(gs, ls, D12, a).orl ∧ gstepf(gs, ls, D12, a).vhead ∈ gstepf(gs, ls, D12, a).orl from lstepf(gs, ls, D12, a).first) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, lstepf(gs, ls, D12, a).first, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns)

Lemma step-D12-D13

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

ls.nxt = null, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D13 → (lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( lstepf(gs, ls, D12, a).first ∈ gstepf(gs, ls, D12, a).orl ∧ gstepf(gs, ls, D12, a).vhead ∈ gstepf(gs, ls, D12, a).orl from lstepf(gs, ls, D12, a).first) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, lstepf(gs, ls, D12, a).first, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

ls.nxt = null, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D13

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

ls.nxt = null, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, gs.orl ≠ [], DMSQLInv(gs, ls, D12), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D12, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D13, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D12], <all paths>

Additional information

Used simplifier rules: ⊦ D12 ≠ crashed; (s) ⊦ D12 ≠ D32; (s) ⊦ D12 ≠ D33; (s) ⊦ D12 ≠ idle; (s) ⊦ D12 ≠ ready; (s) ⊦ D12 ≠ E1; (s) ⊦ D12 ≠ E17; (s) ⊦ D1 ≠ D12; (s) ⊦ D2 ≠ D12; (s) ⊦ D7 ≠ D12; (s) ⊦ D12 ≠ E4; (s) ⊦ D12 ≠ E16; (s) ⊦ D12 ≠ E15; (s) ⊦ D12 ≠ E14; (s) ⊦ D12 ≠ E13; (s) ⊦ D12 ≠ E12; (s) ⊦ D12 ≠ E11; (s) ⊦ D12 ≠ E10; (s) ⊦ D12 ≠ E9; (s) ⊦ D12 ≠ E8; (s) ⊦ D12 ≠ E7; (s) ⊦ D12 ≠ E6; (s) ⊦ D12 ≠ E5; (s) ⊦ D12 ≠ E3; (s) ⊦ D12 ≠ E2; (s) ⊦ D12 ≠ D34; (s) ⊦ D12 ≠ D31; (s) ⊦ D12 ≠ D30; (s) ⊦ D12 ≠ D29; (s) ⊦ D12 ≠ D28; (s) ⊦ D12 ≠ D27; (s) ⊦ D12 ≠ D26; (s) ⊦ D12 ≠ D25; (s) ⊦ D12 ≠ D24; (s) ⊦ D12 ≠ D23; (s) ⊦ D12 ≠ D22; (s) ⊦ D12 ≠ D21; (s) ⊦ D12 ≠ D20; (s) ⊦ D12 ≠ D19; (s) ⊦ D12 ≠ D18; (s) ⊦ D12 ≠ D17; (s) ⊦ D12 ≠ D16; (s) ⊦ D12 ≠ D15; (s) ⊦ D12 ≠ D14; (s) ⊦ D12 ≠ D13; (s) ⊦ D11 ≠ D12; (s) ⊦ D10 ≠ D12; (s) ⊦ D9 ≠ D12; (s) ⊦ D8 ≠ D12; (s) ⊦ D6 ≠ D12; (s) ⊦ D5 ≠ D12; (s) ⊦ D4 ≠ D12; (s) ⊦ D3 ≠ D12; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D12, a) = (ls.nxt = null ⊃ D13;D16); (s) Used terms: gs, ls, D12

Proof step 229 from proof copied-step-DMSQLInv (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 230 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, lstepf(gs, ls, D12, a).nxt = null, gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid), gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, gstepf(gs, ls, D12, a).orl ≠ [], lstepf(gs, ls, D12, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp), allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp), listp(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs), nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, lstepf(gs, ls, D12, a).first, gstepf(gs, ls, D12, a).vs), nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs), noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), pre(gs, ls, D12, a), rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns), rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns), unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps), lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl, lstepf(gs, ls, D12, a).first ∈ gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vhead ∈ gstepf(gs, ls, D12, a).orl from lstepf(gs, ls, D12, a).first, lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp, ¬ lstepf(gs, ls, D12, a).success, ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl), gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val), gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs), gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

lstepf(gs, ls, D12, a).nxt = null, ls.nxt = null, gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid), gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D13, gstepf(gs, ls, D12, a).orl ≠ [], lstepf(gs, ls, D12, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp), allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp), listp(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps), nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, lstepf(gs, ls, D12, a).first, gstepf(gs, ls, D12, a).vs), nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs), noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), pre(gs, ls, D12, a), rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns), rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns), unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps), lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).vhead ∈ gstepf(gs, ls, D12, a).orl from lstepf(gs, ls, D12, a).first, lstepf(gs, ls, D12, a).first ∈ gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl, lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, ¬ lstepf(gs, ls, D12, a).success, ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl), gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val), gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null, gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D13 ≠ D14; (s) ⊦ D13 ≠ D15; (s) ⊦ D13 ≠ D18; (s) ⊦ D13 ≠ D19; (s) ⊦ D13 ≠ D20; (s) ⊦ D13 ≠ D21; (s) ⊦ D13 ≠ E1; (s) ⊦ D13 ≠ E12; (s) ⊦ D13 ≠ E17; (s) ⊦ D13 ≠ D16; (s) ⊦ D13 ≠ D17; (s) ⊦ D13 ≠ D25; (s) ⊦ D13 ≠ D26; (s) ⊦ D13 ≠ D27; (s) ⊦ D13 ≠ D28; (s) ⊦ D13 ≠ D29; (s) ⊦ D13 ≠ D30; (s) ⊦ D13 ≠ D31; (s) ⊦ D13 ≠ D32; (s) ⊦ D13 ≠ D33; (s) ⊦ D13 ≠ D34; (s) ⊦ D13 ≠ D22; (s) ⊦ D13 ≠ D23; (s) ⊦ D13 ≠ D24; (s) ⊦ D13 ≠ crashed; (s) ⊦ D13 ≠ idle; (s) ⊦ D13 ≠ ready; (s) ⊦ D1 ≠ D13; (s) ⊦ D2 ≠ D13; (s) ⊦ D3 ≠ D13; (s) ⊦ D4 ≠ D13; (s) ⊦ D5 ≠ D13; (s) ⊦ D6 ≠ D13; (s) ⊦ D7 ≠ D13; (s) ⊦ D8 ≠ D13; (s) ⊦ D9 ≠ D13; (s) ⊦ D10 ≠ D13; (s) ⊦ D11 ≠ D13; (s) ⊦ D12 ≠ D13; (s) ⊦ D13 ≠ E2; (s) ⊦ D13 ≠ E3; (s) ⊦ D13 ≠ E5; (s) ⊦ D13 ≠ E6; (s) ⊦ D13 ≠ E7; (s) ⊦ D13 ≠ E8; (s) ⊦ D13 ≠ E9; (s) ⊦ D13 ≠ E13; (s) ⊦ D13 ≠ E14; (s) ⊦ D13 ≠ E15; (s) ⊦ D13 ≠ E16; (s) ⊦ D13 ≠ E10; (s) ⊦ D13 ≠ E11; (s) ⊦ D13 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D12, τ) = gs; (s) ⊦ lstepf(gs, ls, D12, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 233 from proof copied-step-DMSQLInv (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 234 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D12-D16, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16 → ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok (gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv (gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv (gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs (gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D12, a).vs [gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ ( gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = ( gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast ).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D12, a).vs [(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16 → ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid (lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns)

Lemma step-D12-D16

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

gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16 → ( lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl ∧ lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next ∧ lstepf(gs, ls, D12, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns) ∧ ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps) ∧ markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs) ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps) ∧ gstepf(gs, ls, D12, a).orl ≠ [] ∧ gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl ∧ rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns) ∧ allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp) ∧ dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp ∧ ( gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs)) ∧ ( gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D12, a).success ∧ gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid)) ∧ ( gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref ∧ lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp ∧ lstepf(gs, ls, D12, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs) ∧ noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

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

gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), pre(gs, ls, D12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, ls.nxt ≠ null, gs.orl ≠ [], DMSQLInv(gs, ls, D12), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D12, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D12, a) ∧ pcstepf(gs, ls, D12, a) = D16, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D12], <all paths>

Additional information

Used simplifier rules: ⊦ D12 ≠ crashed; (s) ⊦ D12 ≠ D32; (s) ⊦ D12 ≠ D33; (s) ⊦ D12 ≠ idle; (s) ⊦ D12 ≠ ready; (s) ⊦ D12 ≠ E1; (s) ⊦ D12 ≠ E17; (s) ⊦ D1 ≠ D12; (s) ⊦ D2 ≠ D12; (s) ⊦ D7 ≠ D12; (s) ⊦ D12 ≠ E4; (s) ⊦ D12 ≠ E16; (s) ⊦ D12 ≠ E15; (s) ⊦ D12 ≠ E14; (s) ⊦ D12 ≠ E13; (s) ⊦ D12 ≠ E12; (s) ⊦ D12 ≠ E11; (s) ⊦ D12 ≠ E10; (s) ⊦ D12 ≠ E9; (s) ⊦ D12 ≠ E8; (s) ⊦ D12 ≠ E7; (s) ⊦ D12 ≠ E6; (s) ⊦ D12 ≠ E5; (s) ⊦ D12 ≠ E3; (s) ⊦ D12 ≠ E2; (s) ⊦ D12 ≠ D34; (s) ⊦ D12 ≠ D31; (s) ⊦ D12 ≠ D30; (s) ⊦ D12 ≠ D29; (s) ⊦ D12 ≠ D28; (s) ⊦ D12 ≠ D27; (s) ⊦ D12 ≠ D26; (s) ⊦ D12 ≠ D25; (s) ⊦ D12 ≠ D24; (s) ⊦ D12 ≠ D23; (s) ⊦ D12 ≠ D22; (s) ⊦ D12 ≠ D21; (s) ⊦ D12 ≠ D20; (s) ⊦ D12 ≠ D19; (s) ⊦ D12 ≠ D18; (s) ⊦ D12 ≠ D17; (s) ⊦ D12 ≠ D16; (s) ⊦ D12 ≠ D15; (s) ⊦ D12 ≠ D14; (s) ⊦ D12 ≠ D13; (s) ⊦ D11 ≠ D12; (s) ⊦ D10 ≠ D12; (s) ⊦ D9 ≠ D12; (s) ⊦ D8 ≠ D12; (s) ⊦ D6 ≠ D12; (s) ⊦ D5 ≠ D12; (s) ⊦ D4 ≠ D12; (s) ⊦ D3 ≠ D12; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D12, a) = (ls.nxt = null ⊃ D13;D16); (s) Used terms: gs, ls, D12

Proof step 240 from proof copied-step-DMSQLInv (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 241 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next, gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid), gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, lstepf(gs, ls, D12, a).nxt ≠ null, ls.nxt ≠ null, gstepf(gs, ls, D12, a).orl ≠ [], lstepf(gs, ls, D12, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp), allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp), listp(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs), nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs), noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), pre(gs, ls, D12, a), rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns), rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns), unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps), lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl, lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp, ¬ lstepf(gs, ls, D12, a).success, ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl), gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val), gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs), gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

lstepf(gs, ls, D12, a).nxt = gstepf(gs, ls, D12, a).vs[lstepf(gs, ls, D12, a).lst].next, gstepf(gs, ls, D12, a).pretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, gstepf(gs, ls, D12, a).rvowns(gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid)) = Pending(lstepf(gs, ls, D12, a).tid), gstepf(gs, ls, D12, a).vretRefs(lstepf(gs, ls, D12, a).tid) = lstepf(gs, ls, D12, a).rvref, dom gstepf(gs, ls, D12, a).vrvHp = dom gstepf(gs, ls, D12, a).prvHp, gs0 = gstepf(gs, ls, D12, a), ls0 = lstepf(gs, ls, D12, a), pc0 = D16, lstepf(gs, ls, D12, a).nxt ≠ null, ls.nxt ≠ null, gstepf(gs, ls, D12, a).orl ≠ [], lstepf(gs, ls, D12, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D12), allocrv(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp), allocrv(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp), listp(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).ps, gstepf(gs, ls, D12, a).owns), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).vs), markedp(gstepf(gs, ls, D12, a).orl, gstepf(gs, ls, D12, a).ps), nextnottid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), noid(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vhead, gstepf(gs, ls, D12, a).vs), nonullRetRefs (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs, gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).pretRefs), noowns(lstepf(gs, ls, D12, a).tid, gstepf(gs, ls, D12, a).owns), pre(gs, ls, D12, a), rvownerok(gstepf(gs, ls, D12, a).pretRefs, gstepf(gs, ls, D12, a).prvHp, gstepf(gs, ls, D12, a).rvowns), rvownerok(gstepf(gs, ls, D12, a).vretRefs, gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).rvowns), unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).ps), lstepf(gs, ls, D12, a).rvref ∈ gstepf(gs, ls, D12, a).vrvHp, gstepf(gs, ls, D12, a).phead ∈ gstepf(gs, ls, D12, a).orl, lstepf(gs, ls, D12, a).lst ∈ gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl, ¬ lstepf(gs, ls, D12, a).success, ¬ dups(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl), gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next ≠ null ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D12, a).rvowns (gstepf(gs, ls, D12, a).vretRefs(gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].deqID.tid, gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).vhead].next].val), gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last ∨ gstepf(gs, ls, D12, a).qrl ≠ [] ∧ gstepf(gs, ls, D12, a).vtail = (gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl.butlast).last ∧ gstepf(gs, ls, D12, a).vs[gstepf(gs, ls, D12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D12, a).vs[(gstepf(gs, ls, D12, a).orl + gstepf(gs, ls, D12, a).qrl).last].next = null, gstepf(gs, ls, D12, a).orl.last = gstepf(gs, ls, D12, a).vhead ∧ (gstepf(gs, ls, D12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D12, a).qrl.tail, gstepf(gs, ls, D12, a).vs)) ∨ gstepf(gs, ls, D12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D12, a).orl.butlast.last = gstepf(gs, ls, D12, a).vhead ∧ gstepf(gs, ls, D12, a).phead ≠ gstepf(gs, ls, D12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D12, a).qrl, gstepf(gs, ls, D12, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D12, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D16 ≠ D17; (s) ⊦ D16 ≠ D31; (s) ⊦ D16 ≠ D34; (s) ⊦ D16 ≠ D25; (s) ⊦ D16 ≠ D26; (s) ⊦ D16 ≠ D27; (s) ⊦ D16 ≠ D28; (s) ⊦ D16 ≠ D29; (s) ⊦ D16 ≠ D30; (s) ⊦ D16 ≠ D20; (s) ⊦ D16 ≠ D21; (s) ⊦ D16 ≠ E1; (s) ⊦ D16 ≠ E12; (s) ⊦ D16 ≠ E17; (s) ⊦ D16 ≠ D18; (s) ⊦ D16 ≠ D19; (s) ⊦ D16 ≠ D22; (s) ⊦ D16 ≠ D23; (s) ⊦ D16 ≠ D24; (s) ⊦ D16 ≠ crashed; (s) ⊦ D16 ≠ idle; (s) ⊦ D16 ≠ ready; (s) ⊦ D1 ≠ D16; (s) ⊦ D2 ≠ D16; (s) ⊦ D3 ≠ D16; (s) ⊦ D4 ≠ D16; (s) ⊦ D5 ≠ D16; (s) ⊦ D6 ≠ D16; (s) ⊦ D7 ≠ D16; (s) ⊦ D8 ≠ D16; (s) ⊦ D9 ≠ D16; (s) ⊦ D10 ≠ D16; (s) ⊦ D11 ≠ D16; (s) ⊦ D12 ≠ D16; (s) ⊦ D13 ≠ D16; (s) ⊦ D14 ≠ D16; (s) ⊦ D15 ≠ D16; (s) ⊦ D16 ≠ E2; (s) ⊦ D16 ≠ E3; (s) ⊦ D16 ≠ E5; (s) ⊦ D16 ≠ E6; (s) ⊦ D16 ≠ E7; (s) ⊦ D16 ≠ E8; (s) ⊦ D16 ≠ E9; (s) ⊦ D16 ≠ E13; (s) ⊦ D16 ≠ E14; (s) ⊦ D16 ≠ E15; (s) ⊦ D16 ≠ E16; (s) ⊦ D16 ≠ E10; (s) ⊦ D16 ≠ E11; (s) ⊦ D16 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D12, τ) = gs; (s) ⊦ lstepf(gs, ls, D12, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 244 from proof copied-step-DMSQLInv (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 245 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D13, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = pcstepf(gs, ls, D13, a), DMSQGInv(gs), DMSQLInv(gs, ls, D13), pre(gs, ls, D13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D13, seq: ⊦ pcstepf(gs, ls, D13, a) = D14, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D13, a) = D14

A spec-lemma

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

gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, DMSQGInv(gs), DMSQLInv(gs, ls, D13), pre(gs, ls, D13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D13-D14, seq:⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → ( lstepf(gs, ls, D13, a).lst ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl ∧ gstepf(gs, ls, D13, a).vrvHp[lstepf(gs, ls, D13, a).rvref] = Empty ∧ lstepf(gs, ls, D13, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ ¬ dups(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).ps) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vs) ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).ps) ∧ gstepf(gs, ls, D13, a).orl ≠ [] ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl ∧ rvownerok (gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv (gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv (gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp) ∧ dom gstepf(gs, ls, D13, a).vrvHp = dom gstepf(gs, ls, D13, a).prvHp ∧ ( gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ≠ null ∧ gstepf(gs, ls, D13, a).vs [gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs (gstepf(gs, ls, D13, a).vs [gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D13, a).vs [gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D13, a).vs [gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D13, a).orl.last = gstepf(gs, ls, D13, a).vhead ∧ ( gstepf(gs, ls, D13, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D13, a).qrl.tail, gstepf(gs, ls, D13, a).vs)) ∨ gstepf(gs, ls, D13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D13, a).orl.butlast.last = gstepf(gs, ls, D13, a).vhead ∧ gstepf(gs, ls, D13, a).phead ≠ gstepf(gs, ls, D13, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs)) ∧ ( gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last ∨ gstepf(gs, ls, D13, a).qrl ≠ [] ∧ gstepf(gs, ls, D13, a).vtail = ( gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl.butlast ).last ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D13, a).vs [(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D13, a).success ∧ gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid)) = Pending(lstepf(gs, ls, D13, a).tid)) ∧ ( lstepf(gs, ls, D13, a).first ∈ gstepf(gs, ls, D13, a).orl ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl from lstepf(gs, ls, D13, a).first) ∧ ( gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ gstepf(gs, ls, D13, a).pretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ lstepf(gs, ls, D13, a).rvref ∈ gstepf(gs, ls, D13, a).vrvHp ∧ lstepf(gs, ls, D13, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ noid (lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, lstepf(gs, ls, D13, a).first, gstepf(gs, ls, D13, a).vs) ∧ noowns(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → ( lstepf(gs, ls, D13, a).lst ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl ∧ gstepf(gs, ls, D13, a).vrvHp[lstepf(gs, ls, D13, a).rvref] = Empty ∧ lstepf(gs, ls, D13, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ ¬ dups(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).ps) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vs) ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).ps) ∧ gstepf(gs, ls, D13, a).orl ≠ [] ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl ∧ rvownerok(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp) ∧ dom gstepf(gs, ls, D13, a).vrvHp = dom gstepf(gs, ls, D13, a).prvHp ∧ ( gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ≠ null ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs(gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid, gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D13, a).orl.last = gstepf(gs, ls, D13, a).vhead ∧ (gstepf(gs, ls, D13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D13, a).qrl.tail, gstepf(gs, ls, D13, a).vs)) ∨ gstepf(gs, ls, D13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D13, a).orl.butlast.last = gstepf(gs, ls, D13, a).vhead ∧ gstepf(gs, ls, D13, a).phead ≠ gstepf(gs, ls, D13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs)) ∧ ( gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last ∨ gstepf(gs, ls, D13, a).qrl ≠ [] ∧ gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl.butlast).last ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D13, a).vs[(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D13, a).success ∧ gstepf(gs, ls, D13, a).rvowns(gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid)) = Pending(lstepf(gs, ls, D13, a).tid)) ∧ ( lstepf(gs, ls, D13, a).first ∈ gstepf(gs, ls, D13, a).orl ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl from lstepf(gs, ls, D13, a).first) ∧ ( gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ gstepf(gs, ls, D13, a).pretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ lstepf(gs, ls, D13, a).rvref ∈ gstepf(gs, ls, D13, a).vrvHp ∧ lstepf(gs, ls, D13, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ noid (lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, lstepf(gs, ls, D13, a).first, gstepf(gs, ls, D13, a).vs) ∧ noowns(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).owns)

Lemma step-D13-D14

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

gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, DMSQGInv(gs), DMSQLInv(gs, ls, D13), pre(gs, ls, D13, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14 → ( lstepf(gs, ls, D13, a).lst ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl ∧ gstepf(gs, ls, D13, a).vrvHp[lstepf(gs, ls, D13, a).rvref] = Empty ∧ lstepf(gs, ls, D13, a).nxt = null) ∧ ( listp (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ ¬ dups(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).ps) ∧ markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vs) ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).ps) ∧ gstepf(gs, ls, D13, a).orl ≠ [] ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl ∧ rvownerok(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp, gstepf(gs, ls, D13, a).rvowns) ∧ allocrv(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp) ∧ dom gstepf(gs, ls, D13, a).vrvHp = dom gstepf(gs, ls, D13, a).prvHp ∧ ( gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ≠ null ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs(gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid, gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D13, a).orl.last = gstepf(gs, ls, D13, a).vhead ∧ (gstepf(gs, ls, D13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D13, a).qrl.tail, gstepf(gs, ls, D13, a).vs)) ∨ gstepf(gs, ls, D13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D13, a).orl.butlast.last = gstepf(gs, ls, D13, a).vhead ∧ gstepf(gs, ls, D13, a).phead ≠ gstepf(gs, ls, D13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs)) ∧ ( gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last ∨ gstepf(gs, ls, D13, a).qrl ≠ [] ∧ gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl.butlast).last ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D13, a).vs[(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D13, a).success ∧ gstepf(gs, ls, D13, a).rvowns(gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid)) = Pending(lstepf(gs, ls, D13, a).tid)) ∧ ( lstepf(gs, ls, D13, a).first ∈ gstepf(gs, ls, D13, a).orl ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl from lstepf(gs, ls, D13, a).first) ∧ ( gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ gstepf(gs, ls, D13, a).pretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref ∧ lstepf(gs, ls, D13, a).rvref ∈ gstepf(gs, ls, D13, a).vrvHp ∧ lstepf(gs, ls, D13, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ noid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, lstepf(gs, ls, D13, a).first, gstepf(gs, ls, D13, a).vs) ∧ noowns(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, DMSQGInv(gs), DMSQLInv(gs, ls, D13), pre(gs, ls, D13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, gs.orl ≠ [], DMSQLInv(gs, ls, D13), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D13, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D13, a) ∧ pcstepf(gs, ls, D13, a) = D14, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D13], <all paths>

Additional information

Used simplifier rules: ⊦ D13 ≠ crashed; (s) ⊦ D13 ≠ idle; (s) ⊦ D13 ≠ ready; (s) ⊦ D13 ≠ E1; (s) ⊦ D13 ≠ E17; (s) ⊦ D1 ≠ D13; (s) ⊦ D2 ≠ D13; (s) ⊦ D7 ≠ D13; (s) ⊦ D13 ≠ D32; (s) ⊦ D13 ≠ D33; (s) ⊦ D13 ≠ E4; (s) ⊦ D13 ≠ E16; (s) ⊦ D13 ≠ E15; (s) ⊦ D13 ≠ E14; (s) ⊦ D13 ≠ E13; (s) ⊦ D13 ≠ E12; (s) ⊦ D13 ≠ E11; (s) ⊦ D13 ≠ E10; (s) ⊦ D13 ≠ E9; (s) ⊦ D13 ≠ E8; (s) ⊦ D13 ≠ E7; (s) ⊦ D13 ≠ E6; (s) ⊦ D13 ≠ E5; (s) ⊦ D13 ≠ E3; (s) ⊦ D13 ≠ E2; (s) ⊦ D13 ≠ D34; (s) ⊦ D13 ≠ D31; (s) ⊦ D13 ≠ D30; (s) ⊦ D13 ≠ D29; (s) ⊦ D13 ≠ D28; (s) ⊦ D13 ≠ D27; (s) ⊦ D13 ≠ D26; (s) ⊦ D13 ≠ D25; (s) ⊦ D13 ≠ D24; (s) ⊦ D13 ≠ D23; (s) ⊦ D13 ≠ D22; (s) ⊦ D13 ≠ D21; (s) ⊦ D13 ≠ D20; (s) ⊦ D13 ≠ D19; (s) ⊦ D13 ≠ D18; (s) ⊦ D13 ≠ D17; (s) ⊦ D13 ≠ D16; (s) ⊦ D13 ≠ D15; (s) ⊦ D13 ≠ D14; (s) ⊦ D12 ≠ D13; (s) ⊦ D11 ≠ D13; (s) ⊦ D10 ≠ D13; (s) ⊦ D9 ≠ D13; (s) ⊦ D8 ≠ D13; (s) ⊦ D6 ≠ D13; (s) ⊦ D5 ≠ D13; (s) ⊦ D4 ≠ D13; (s) ⊦ D3 ≠ D13; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D13, a) = D14; (s) Used terms: gs, ls, D13

Proof step 254 from proof copied-step-DMSQLInv (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 255 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D13, a).nxt = null, gstepf(gs, ls, D13, a).pretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref, gstepf(gs, ls, D13, a).rvowns(gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid)) = Pending(lstepf(gs, ls, D13, a).tid), gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref, gstepf(gs, ls, D13, a).vrvHp[lstepf(gs, ls, D13, a).rvref] = Empty, dom gstepf(gs, ls, D13, a).vrvHp = dom gstepf(gs, ls, D13, a).prvHp, gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, gstepf(gs, ls, D13, a).orl ≠ [], lstepf(gs, ls, D13, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D13), allocrv(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp), allocrv(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp), listp(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns), markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).ps), markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vs), nextnottid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs), noid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, lstepf(gs, ls, D13, a).first, gstepf(gs, ls, D13, a).vs), nonullRetRefs (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).pretRefs), noowns(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).owns), pre(gs, ls, D13, a), rvownerok(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).rvowns), rvownerok(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp, gstepf(gs, ls, D13, a).rvowns), unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).ps), lstepf(gs, ls, D13, a).lst ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl, lstepf(gs, ls, D13, a).first ∈ gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl from lstepf(gs, ls, D13, a).first, lstepf(gs, ls, D13, a).rvref ∈ gstepf(gs, ls, D13, a).vrvHp, ¬ lstepf(gs, ls, D13, a).success, ¬ dups(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl), gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ≠ null ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs(gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid, gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].val), gstepf(gs, ls, D13, a).orl.last = gstepf(gs, ls, D13, a).vhead ∧ (gstepf(gs, ls, D13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D13, a).qrl.tail, gstepf(gs, ls, D13, a).vs)) ∨ gstepf(gs, ls, D13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D13, a).orl.butlast.last = gstepf(gs, ls, D13, a).vhead ∧ gstepf(gs, ls, D13, a).phead ≠ gstepf(gs, ls, D13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs), gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last ∨ gstepf(gs, ls, D13, a).qrl ≠ [] ∧ gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl.butlast).last ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D13, a).vs[(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

lstepf(gs, ls, D13, a).nxt = null, gstepf(gs, ls, D13, a).pretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref, gstepf(gs, ls, D13, a).rvowns(gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid)) = Pending(lstepf(gs, ls, D13, a).tid), gstepf(gs, ls, D13, a).vretRefs(lstepf(gs, ls, D13, a).tid) = lstepf(gs, ls, D13, a).rvref, gstepf(gs, ls, D13, a).vrvHp[lstepf(gs, ls, D13, a).rvref] = Empty, dom gstepf(gs, ls, D13, a).vrvHp = dom gstepf(gs, ls, D13, a).prvHp, gs0 = gstepf(gs, ls, D13, a), ls0 = lstepf(gs, ls, D13, a), pc0 = D14, gstepf(gs, ls, D13, a).orl ≠ [], lstepf(gs, ls, D13, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D13), allocrv(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp), allocrv(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp), listp(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns), markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).vs), markedp(gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).ps), nextnottid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs), noid(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, lstepf(gs, ls, D13, a).first, gstepf(gs, ls, D13, a).vs), nonullRetRefs (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).pretRefs), noowns(lstepf(gs, ls, D13, a).tid, gstepf(gs, ls, D13, a).owns), pre(gs, ls, D13, a), rvownerok(gstepf(gs, ls, D13, a).pretRefs, gstepf(gs, ls, D13, a).prvHp, gstepf(gs, ls, D13, a).rvowns), rvownerok(gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).rvowns), unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).ps), lstepf(gs, ls, D13, a).rvref ∈ gstepf(gs, ls, D13, a).vrvHp, gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl from lstepf(gs, ls, D13, a).first, lstepf(gs, ls, D13, a).first ∈ gstepf(gs, ls, D13, a).orl, gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl, lstepf(gs, ls, D13, a).lst ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, ¬ lstepf(gs, ls, D13, a).success, ¬ dups(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl), gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next ≠ null ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D13, a).rvowns (gstepf(gs, ls, D13, a).vretRefs(gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].deqID.tid, gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).vhead].next].val), gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last ∨ gstepf(gs, ls, D13, a).qrl ≠ [] ∧ gstepf(gs, ls, D13, a).vtail = (gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl.butlast).last ∧ gstepf(gs, ls, D13, a).vs[gstepf(gs, ls, D13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D13, a).vs[(gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl).last].next = null, gstepf(gs, ls, D13, a).orl.last = gstepf(gs, ls, D13, a).vhead ∧ (gstepf(gs, ls, D13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D13, a).qrl.tail, gstepf(gs, ls, D13, a).vs)) ∨ gstepf(gs, ls, D13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D13, a).orl.butlast.last = gstepf(gs, ls, D13, a).vhead ∧ gstepf(gs, ls, D13, a).phead ≠ gstepf(gs, ls, D13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D13, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D14 ≠ D15; (s) ⊦ D14 ≠ D18; (s) ⊦ D14 ≠ D19; (s) ⊦ D14 ≠ D20; (s) ⊦ D14 ≠ D21; (s) ⊦ D14 ≠ E1; (s) ⊦ D14 ≠ E12; (s) ⊦ D14 ≠ E17; (s) ⊦ D14 ≠ D16; (s) ⊦ D14 ≠ D17; (s) ⊦ D14 ≠ D25; (s) ⊦ D14 ≠ D26; (s) ⊦ D14 ≠ D27; (s) ⊦ D14 ≠ D28; (s) ⊦ D14 ≠ D29; (s) ⊦ D14 ≠ D30; (s) ⊦ D14 ≠ D31; (s) ⊦ D14 ≠ D32; (s) ⊦ D14 ≠ D33; (s) ⊦ D14 ≠ D34; (s) ⊦ D14 ≠ D22; (s) ⊦ D14 ≠ D23; (s) ⊦ D14 ≠ D24; (s) ⊦ D14 ≠ crashed; (s) ⊦ D14 ≠ idle; (s) ⊦ D14 ≠ ready; (s) ⊦ D1 ≠ D14; (s) ⊦ D2 ≠ D14; (s) ⊦ D3 ≠ D14; (s) ⊦ D4 ≠ D14; (s) ⊦ D5 ≠ D14; (s) ⊦ D6 ≠ D14; (s) ⊦ D7 ≠ D14; (s) ⊦ D8 ≠ D14; (s) ⊦ D9 ≠ D14; (s) ⊦ D10 ≠ D14; (s) ⊦ D11 ≠ D14; (s) ⊦ D12 ≠ D14; (s) ⊦ D13 ≠ D14; (s) ⊦ D14 ≠ E2; (s) ⊦ D14 ≠ E3; (s) ⊦ D14 ≠ E5; (s) ⊦ D14 ≠ E6; (s) ⊦ D14 ≠ E7; (s) ⊦ D14 ≠ E8; (s) ⊦ D14 ≠ E9; (s) ⊦ D14 ≠ E13; (s) ⊦ D14 ≠ E14; (s) ⊦ D14 ≠ E15; (s) ⊦ D14 ≠ E16; (s) ⊦ D14 ≠ E10; (s) ⊦ D14 ≠ E11; (s) ⊦ D14 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ gstepf(gs, ls, D13, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, Empty]; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, D13, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 258 from proof copied-step-DMSQLInv (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 259 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D14, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

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

gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = pcstepf(gs, ls, D14, a), DMSQGInv(gs), DMSQLInv(gs, ls, D14), pre(gs, ls, D14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D14, seq: ⊦ pcstepf(gs, ls, D14, a) = D15, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

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

⊦ pcstepf(gs, ls, D14, a) = D15

A spec-lemma

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

gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, DMSQGInv(gs), DMSQLInv(gs, ls, D14), pre(gs, ls, D14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D14-D15, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → ( lstepf(gs, ls, D14, a).lst ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl ∧ gstepf(gs, ls, D14, a).vrvHp[lstepf(gs, ls, D14, a).rvref] = Empty ∧ gstepf(gs, ls, D14, a).prvHp[lstepf(gs, ls, D14, a).rvref] = Empty) ∧ ( listp (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ ¬ dups(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).ps) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vs) ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).ps) ∧ gstepf(gs, ls, D14, a).orl ≠ [] ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl ∧ rvownerok (gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv (gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv (gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp) ∧ dom gstepf(gs, ls, D14, a).vrvHp = dom gstepf(gs, ls, D14, a).prvHp ∧ ( gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ≠ null ∧ gstepf(gs, ls, D14, a).vs [gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs (gstepf(gs, ls, D14, a).vs [gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D14, a).vs [gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D14, a).vs [gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D14, a).orl.last = gstepf(gs, ls, D14, a).vhead ∧ ( gstepf(gs, ls, D14, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D14, a).qrl.tail, gstepf(gs, ls, D14, a).vs)) ∨ gstepf(gs, ls, D14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D14, a).orl.butlast.last = gstepf(gs, ls, D14, a).vhead ∧ gstepf(gs, ls, D14, a).phead ≠ gstepf(gs, ls, D14, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs)) ∧ ( gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last ∨ gstepf(gs, ls, D14, a).qrl ≠ [] ∧ gstepf(gs, ls, D14, a).vtail = ( gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl.butlast ).last ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D14, a).vs [(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D14, a).success ∧ gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid)) = Pending(lstepf(gs, ls, D14, a).tid)) ∧ ( lstepf(gs, ls, D14, a).first ∈ gstepf(gs, ls, D14, a).orl ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl from lstepf(gs, ls, D14, a).first) ∧ ( gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ gstepf(gs, ls, D14, a).pretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ lstepf(gs, ls, D14, a).rvref ∈ gstepf(gs, ls, D14, a).vrvHp ∧ lstepf(gs, ls, D14, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ noid (lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, lstepf(gs, ls, D14, a).first, gstepf(gs, ls, D14, a).vs) ∧ noowns(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

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

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → ( lstepf(gs, ls, D14, a).lst ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl ∧ gstepf(gs, ls, D14, a).vrvHp[lstepf(gs, ls, D14, a).rvref] = Empty ∧ gstepf(gs, ls, D14, a).prvHp[lstepf(gs, ls, D14, a).rvref] = Empty) ∧ ( listp (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ ¬ dups(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).ps) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vs) ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).ps) ∧ gstepf(gs, ls, D14, a).orl ≠ [] ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl ∧ rvownerok(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp) ∧ dom gstepf(gs, ls, D14, a).vrvHp = dom gstepf(gs, ls, D14, a).prvHp ∧ ( gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ≠ null ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs(gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid, gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D14, a).orl.last = gstepf(gs, ls, D14, a).vhead ∧ (gstepf(gs, ls, D14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D14, a).qrl.tail, gstepf(gs, ls, D14, a).vs)) ∨ gstepf(gs, ls, D14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D14, a).orl.butlast.last = gstepf(gs, ls, D14, a).vhead ∧ gstepf(gs, ls, D14, a).phead ≠ gstepf(gs, ls, D14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs)) ∧ ( gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last ∨ gstepf(gs, ls, D14, a).qrl ≠ [] ∧ gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl.butlast).last ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D14, a).vs[(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D14, a).success ∧ gstepf(gs, ls, D14, a).rvowns(gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid)) = Pending(lstepf(gs, ls, D14, a).tid)) ∧ ( lstepf(gs, ls, D14, a).first ∈ gstepf(gs, ls, D14, a).orl ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl from lstepf(gs, ls, D14, a).first) ∧ ( gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ gstepf(gs, ls, D14, a).pretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ lstepf(gs, ls, D14, a).rvref ∈ gstepf(gs, ls, D14, a).vrvHp ∧ lstepf(gs, ls, D14, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ noid (lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, lstepf(gs, ls, D14, a).first, gstepf(gs, ls, D14, a).vs) ∧ noowns(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).owns)

Lemma step-D14-D15

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

gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, DMSQGInv(gs), DMSQLInv(gs, ls, D14), pre(gs, ls, D14, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15 → ( lstepf(gs, ls, D14, a).lst ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl ∧ gstepf(gs, ls, D14, a).vrvHp[lstepf(gs, ls, D14, a).rvref] = Empty ∧ gstepf(gs, ls, D14, a).prvHp[lstepf(gs, ls, D14, a).rvref] = Empty) ∧ ( listp (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ ¬ dups(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).ps) ∧ markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vs) ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).ps) ∧ gstepf(gs, ls, D14, a).orl ≠ [] ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl ∧ rvownerok(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp, gstepf(gs, ls, D14, a).rvowns) ∧ allocrv(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp) ∧ dom gstepf(gs, ls, D14, a).vrvHp = dom gstepf(gs, ls, D14, a).prvHp ∧ ( gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ≠ null ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs(gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid, gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D14, a).orl.last = gstepf(gs, ls, D14, a).vhead ∧ (gstepf(gs, ls, D14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D14, a).qrl.tail, gstepf(gs, ls, D14, a).vs)) ∨ gstepf(gs, ls, D14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D14, a).orl.butlast.last = gstepf(gs, ls, D14, a).vhead ∧ gstepf(gs, ls, D14, a).phead ≠ gstepf(gs, ls, D14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs)) ∧ ( gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last ∨ gstepf(gs, ls, D14, a).qrl ≠ [] ∧ gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl.butlast).last ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D14, a).vs[(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D14, a).success ∧ gstepf(gs, ls, D14, a).rvowns(gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid)) = Pending(lstepf(gs, ls, D14, a).tid)) ∧ ( lstepf(gs, ls, D14, a).first ∈ gstepf(gs, ls, D14, a).orl ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl from lstepf(gs, ls, D14, a).first) ∧ ( gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ gstepf(gs, ls, D14, a).pretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref ∧ lstepf(gs, ls, D14, a).rvref ∈ gstepf(gs, ls, D14, a).vrvHp ∧ lstepf(gs, ls, D14, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ noid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, lstepf(gs, ls, D14, a).first, gstepf(gs, ls, D14, a).vs) ∧ noowns(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

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

gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, DMSQGInv(gs), DMSQLInv(gs, ls, D14), pre(gs, ls, D14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

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

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

A spec-lemma

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

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, gs.orl ≠ [], DMSQLInv(gs, ls, D14), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D14, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D14, a) ∧ pcstepf(gs, ls, D14, a) = D15, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D14], <all paths>

Additional information

Used simplifier rules: ⊦ D14 ≠ crashed; (s) ⊦ D14 ≠ idle; (s) ⊦ D14 ≠ ready; (s) ⊦ D14 ≠ E1; (s) ⊦ D14 ≠ E17; (s) ⊦ D1 ≠ D14; (s) ⊦ D2 ≠ D14; (s) ⊦ D7 ≠ D14; (s) ⊦ D14 ≠ D32; (s) ⊦ D14 ≠ D33; (s) ⊦ D14 ≠ E4; (s) ⊦ D14 ≠ E16; (s) ⊦ D14 ≠ E15; (s) ⊦ D14 ≠ E14; (s) ⊦ D14 ≠ E13; (s) ⊦ D14 ≠ E12; (s) ⊦ D14 ≠ E11; (s) ⊦ D14 ≠ E10; (s) ⊦ D14 ≠ E9; (s) ⊦ D14 ≠ E8; (s) ⊦ D14 ≠ E7; (s) ⊦ D14 ≠ E6; (s) ⊦ D14 ≠ E5; (s) ⊦ D14 ≠ E3; (s) ⊦ D14 ≠ E2; (s) ⊦ D14 ≠ D34; (s) ⊦ D14 ≠ D31; (s) ⊦ D14 ≠ D30; (s) ⊦ D14 ≠ D29; (s) ⊦ D14 ≠ D28; (s) ⊦ D14 ≠ D27; (s) ⊦ D14 ≠ D26; (s) ⊦ D14 ≠ D25; (s) ⊦ D14 ≠ D24; (s) ⊦ D14 ≠ D23; (s) ⊦ D14 ≠ D22; (s) ⊦ D14 ≠ D21; (s) ⊦ D14 ≠ D20; (s) ⊦ D14 ≠ D19; (s) ⊦ D14 ≠ D18; (s) ⊦ D14 ≠ D17; (s) ⊦ D14 ≠ D16; (s) ⊦ D14 ≠ D15; (s) ⊦ D13 ≠ D14; (s) ⊦ D12 ≠ D14; (s) ⊦ D11 ≠ D14; (s) ⊦ D10 ≠ D14; (s) ⊦ D9 ≠ D14; (s) ⊦ D8 ≠ D14; (s) ⊦ D6 ≠ D14; (s) ⊦ D5 ≠ D14; (s) ⊦ D4 ≠ D14; (s) ⊦ D3 ≠ D14; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ pcstepf(gs, ls, D14, a) = D15; (s) Used terms: gs, ls, D14

Proof step 268 from proof copied-step-DMSQLInv (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 269 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D14, a).pretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref, gstepf(gs, ls, D14, a).rvowns(gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid)) = Pending(lstepf(gs, ls, D14, a).tid), gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref, gstepf(gs, ls, D14, a).vrvHp[lstepf(gs, ls, D14, a).rvref] = Empty, gstepf(gs, ls, D14, a).prvHp[lstepf(gs, ls, D14, a).rvref] = Empty, dom gstepf(gs, ls, D14, a).vrvHp = dom gstepf(gs, ls, D14, a).prvHp, gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, gstepf(gs, ls, D14, a).orl ≠ [], lstepf(gs, ls, D14, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D14), allocrv(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp), allocrv(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp), listp(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns), markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).ps), markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vs), nextnottid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs), noid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, lstepf(gs, ls, D14, a).first, gstepf(gs, ls, D14, a).vs), nonullRetRefs (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).pretRefs), noowns(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).owns), pre(gs, ls, D14, a), rvownerok(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).rvowns), rvownerok(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp, gstepf(gs, ls, D14, a).rvowns), unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).ps), lstepf(gs, ls, D14, a).lst ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl, lstepf(gs, ls, D14, a).first ∈ gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl from lstepf(gs, ls, D14, a).first, lstepf(gs, ls, D14, a).rvref ∈ gstepf(gs, ls, D14, a).vrvHp, ¬ lstepf(gs, ls, D14, a).success, ¬ dups(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl), gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ≠ null ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs(gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid, gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].val), gstepf(gs, ls, D14, a).orl.last = gstepf(gs, ls, D14, a).vhead ∧ (gstepf(gs, ls, D14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D14, a).qrl.tail, gstepf(gs, ls, D14, a).vs)) ∨ gstepf(gs, ls, D14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D14, a).orl.butlast.last = gstepf(gs, ls, D14, a).vhead ∧ gstepf(gs, ls, D14, a).phead ≠ gstepf(gs, ls, D14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs), gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last ∨ gstepf(gs, ls, D14, a).qrl ≠ [] ∧ gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl.butlast).last ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D14, a).vs[(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

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

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

A spec-lemma

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

gstepf(gs, ls, D14, a).pretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref, gstepf(gs, ls, D14, a).rvowns(gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid)) = Pending(lstepf(gs, ls, D14, a).tid), gstepf(gs, ls, D14, a).vretRefs(lstepf(gs, ls, D14, a).tid) = lstepf(gs, ls, D14, a).rvref, gstepf(gs, ls, D14, a).prvHp[lstepf(gs, ls, D14, a).rvref] = Empty, gstepf(gs, ls, D14, a).vrvHp[lstepf(gs, ls, D14, a).rvref] = Empty, dom gstepf(gs, ls, D14, a).vrvHp = dom gstepf(gs, ls, D14, a).prvHp, gs0 = gstepf(gs, ls, D14, a), ls0 = lstepf(gs, ls, D14, a), pc0 = D15, gstepf(gs, ls, D14, a).orl ≠ [], lstepf(gs, ls, D14, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D14), allocrv(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp), allocrv(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp), listp(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns), markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).vs), markedp(gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).ps), nextnottid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs), noid(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, lstepf(gs, ls, D14, a).first, gstepf(gs, ls, D14, a).vs), nonullRetRefs (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).pretRefs), noowns(lstepf(gs, ls, D14, a).tid, gstepf(gs, ls, D14, a).owns), pre(gs, ls, D14, a), rvownerok(gstepf(gs, ls, D14, a).pretRefs, gstepf(gs, ls, D14, a).prvHp, gstepf(gs, ls, D14, a).rvowns), rvownerok(gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).rvowns), unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).ps), lstepf(gs, ls, D14, a).rvref ∈ gstepf(gs, ls, D14, a).vrvHp, gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl from lstepf(gs, ls, D14, a).first, lstepf(gs, ls, D14, a).first ∈ gstepf(gs, ls, D14, a).orl, gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl, lstepf(gs, ls, D14, a).lst ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, ¬ lstepf(gs, ls, D14, a).success, ¬ dups(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl), gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next ≠ null ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D14, a).rvowns (gstepf(gs, ls, D14, a).vretRefs(gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].deqID.tid, gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).vhead].next].val), gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last ∨ gstepf(gs, ls, D14, a).qrl ≠ [] ∧ gstepf(gs, ls, D14, a).vtail = (gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl.butlast).last ∧ gstepf(gs, ls, D14, a).vs[gstepf(gs, ls, D14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D14, a).vs[(gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl).last].next = null, gstepf(gs, ls, D14, a).orl.last = gstepf(gs, ls, D14, a).vhead ∧ (gstepf(gs, ls, D14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D14, a).qrl.tail, gstepf(gs, ls, D14, a).vs)) ∨ gstepf(gs, ls, D14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D14, a).orl.butlast.last = gstepf(gs, ls, D14, a).vhead ∧ gstepf(gs, ls, D14, a).phead ≠ gstepf(gs, ls, D14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D14, a) ↔ a = doDeqEmpty(ls.tid); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ D15 ≠ D18; (s) ⊦ D15 ≠ D19; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ D15 ≠ D20; (s) ⊦ D15 ≠ D21; (s) ⊦ D15 ≠ E1; (s) ⊦ D15 ≠ E12; (s) ⊦ D15 ≠ E17; (s) ⊦ D15 ≠ D16; (s) ⊦ D15 ≠ D17; (s) ⊦ D15 ≠ D25; (s) ⊦ D15 ≠ D26; (s) ⊦ D15 ≠ D27; (s) ⊦ D15 ≠ D28; (s) ⊦ D15 ≠ D29; (s) ⊦ D15 ≠ D30; (s) ⊦ D15 ≠ D31; (s) ⊦ D15 ≠ D32; (s) ⊦ D15 ≠ D33; (s) ⊦ D15 ≠ D34; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ D15 ≠ D22; (s) ⊦ D15 ≠ D23; (s) ⊦ D15 ≠ D24; (s) ⊦ D15 ≠ crashed; (s) ⊦ D15 ≠ idle; (s) ⊦ D15 ≠ ready; (s) ⊦ D1 ≠ D15; (s) ⊦ D2 ≠ D15; (s) ⊦ D3 ≠ D15; (s) ⊦ D4 ≠ D15; (s) ⊦ D5 ≠ D15; (s) ⊦ D6 ≠ D15; (s) ⊦ D7 ≠ D15; (s) ⊦ D8 ≠ D15; (s) ⊦ D9 ≠ D15; (s) ⊦ D10 ≠ D15; (s) ⊦ D11 ≠ D15; (s) ⊦ D12 ≠ D15; (s) ⊦ D13 ≠ D15; (s) ⊦ D14 ≠ D15; (s) ⊦ gstepf(gs, ls, D14, a) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ D15 ≠ E2; (s) ⊦ D15 ≠ E3; (s) ⊦ D15 ≠ E5; (s) ⊦ D15 ≠ E6; (s) ⊦ D15 ≠ E7; (s) ⊦ D15 ≠ E8; (s) ⊦ D15 ≠ E9; (s) ⊦ D15 ≠ E13; (s) ⊦ D15 ≠ E14; (s) ⊦ D15 ≠ E15; (s) ⊦ D15 ≠ E16; (s) ⊦ D15 ≠ E10; (s) ⊦ D15 ≠ E11; (s) ⊦ D15 ≠ E4; (s) ⊦ lstepf(gs, ls, D14, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 272 from proof copied-step-DMSQLInv (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 273 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D15, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 274 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = pcstepf(gs, ls, D15, a), DMSQGInv(gs), DMSQLInv(gs, ls, D15), pre(gs, ls, D15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D15, seq: ⊦ pcstepf(gs, ls, D15, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 275 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D15, a) = D6

A spec-lemma

Proof step 276 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D15), pre(gs, ls, D15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D15-D6, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6 → ( ( lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref]) ∧ gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = ( lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed (lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns) ∧ ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs) ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps) ∧ gstepf(gs, ls, D15, a).orl ≠ [] ∧ gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl ∧ rvownerok (gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv (gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv (gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp) ∧ dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp ∧ ( gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs [gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs (gstepf(gs, ls, D15, a).vs [gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D15, a).vs [gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D15, a).vs [gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ ( gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs)) ∧ ( gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = ( gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast ).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D15, a).vs [(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp ∧ lstepf(gs, ls, D15, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noid (lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 277 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6 → ( ( lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref]) ∧ gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns) ∧ ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs) ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps) ∧ gstepf(gs, ls, D15, a).orl ≠ [] ∧ gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl ∧ rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp) ∧ dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp ∧ ( gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs)) ∧ ( gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp ∧ lstepf(gs, ls, D15, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noid (lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns)

Lemma step-D15-D6

Proof step 278 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D15), pre(gs, ls, D15, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6 → ( ( lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref]) ∧ gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns) ∧ ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps) ∧ markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs) ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps) ∧ gstepf(gs, ls, D15, a).orl ≠ [] ∧ gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl ∧ rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns) ∧ allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp) ∧ dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp ∧ ( gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs)) ∧ ( gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref ∧ lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp ∧ lstepf(gs, ls, D15, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs) ∧ noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 279 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D15), pre(gs, ls, D15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 280 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 281 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D15), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D15, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D15, a) ∧ pcstepf(gs, ls, D15, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D15], <all paths>

Additional information

Used simplifier rules: ⊦ D15 ≠ crashed; (s) ⊦ D15 ≠ idle; (s) ⊦ D15 ≠ ready; (s) ⊦ D15 ≠ E1; (s) ⊦ D15 ≠ E17; (s) ⊦ D1 ≠ D15; (s) ⊦ D2 ≠ D15; (s) ⊦ D7 ≠ D15; (s) ⊦ D15 ≠ D32; (s) ⊦ D15 ≠ D33; (s) ⊦ D15 ≠ E4; (s) ⊦ D15 ≠ E16; (s) ⊦ D15 ≠ E15; (s) ⊦ D15 ≠ E14; (s) ⊦ D15 ≠ E13; (s) ⊦ D15 ≠ E12; (s) ⊦ D15 ≠ E11; (s) ⊦ D15 ≠ E10; (s) ⊦ D15 ≠ E9; (s) ⊦ D15 ≠ E8; (s) ⊦ D15 ≠ E7; (s) ⊦ D15 ≠ E6; (s) ⊦ D15 ≠ E5; (s) ⊦ D15 ≠ E3; (s) ⊦ D15 ≠ E2; (s) ⊦ D15 ≠ D34; (s) ⊦ D15 ≠ D31; (s) ⊦ D15 ≠ D30; (s) ⊦ D15 ≠ D29; (s) ⊦ D15 ≠ D28; (s) ⊦ D15 ≠ D27; (s) ⊦ D15 ≠ D26; (s) ⊦ D15 ≠ D25; (s) ⊦ D15 ≠ D24; (s) ⊦ D15 ≠ D23; (s) ⊦ D15 ≠ D22; (s) ⊦ D15 ≠ D21; (s) ⊦ D15 ≠ D20; (s) ⊦ D15 ≠ D19; (s) ⊦ D15 ≠ D18; (s) ⊦ D15 ≠ D17; (s) ⊦ D15 ≠ D16; (s) ⊦ D14 ≠ D15; (s) ⊦ D13 ≠ D15; (s) ⊦ D12 ≠ D15; (s) ⊦ D11 ≠ D15; (s) ⊦ D10 ≠ D15; (s) ⊦ D9 ≠ D15; (s) ⊦ D8 ≠ D15; (s) ⊦ D6 ≠ D15; (s) ⊦ D5 ≠ D15; (s) ⊦ D4 ≠ D15; (s) ⊦ D3 ≠ D15; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D15, a) = D6; (s) Used terms: gs, ls, D15

Proof step 282 from proof copied-step-DMSQLInv (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 283 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref, gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) ), gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref, dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp, gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, gstepf(gs, ls, D15, a).orl ≠ [], lstepf(gs, ls, D15, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D15), allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp), allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp), listp(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns), markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps), markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs), nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs), noid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs), nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs), noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns), pre(gs, ls, D15, a), rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns), rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns), unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps), gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl, lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp, ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl), lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref], gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val), gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs), gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 284 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 285 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D15, a).pretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref, gstepf(gs, ls, D15, a).rvowns(gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid)) = (lstepf(gs, ls, D15, a).optval = Empty ∨ ¬ lstepf(gs, ls, D15, a).success ⊃ Pending(lstepf(gs, ls, D15, a).tid) ;Claimed(lstepf(gs, ls, D15, a).tid, lstepf(gs, ls, D15, a).optval.val) ), gstepf(gs, ls, D15, a).vretRefs(lstepf(gs, ls, D15, a).tid) = lstepf(gs, ls, D15, a).rvref, dom gstepf(gs, ls, D15, a).vrvHp = dom gstepf(gs, ls, D15, a).prvHp, gs0 = gstepf(gs, ls, D15, a), ls0 = lstepf(gs, ls, D15, a), pc0 = D6, gstepf(gs, ls, D15, a).orl ≠ [], lstepf(gs, ls, D15, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D15), allocrv(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp), allocrv(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp), listp(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).ps, gstepf(gs, ls, D15, a).owns), markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).vs), markedp(gstepf(gs, ls, D15, a).orl, gstepf(gs, ls, D15, a).ps), nextnottid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs), noid(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vhead, gstepf(gs, ls, D15, a).vs), nonullRetRefs (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs, gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).pretRefs), noowns(lstepf(gs, ls, D15, a).tid, gstepf(gs, ls, D15, a).owns), pre(gs, ls, D15, a), rvownerok(gstepf(gs, ls, D15, a).pretRefs, gstepf(gs, ls, D15, a).prvHp, gstepf(gs, ls, D15, a).rvowns), rvownerok(gstepf(gs, ls, D15, a).vretRefs, gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).rvowns), unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).ps), lstepf(gs, ls, D15, a).rvref ∈ gstepf(gs, ls, D15, a).vrvHp, gstepf(gs, ls, D15, a).phead ∈ gstepf(gs, ls, D15, a).orl, ¬ dups(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl), gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next ≠ null ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D15, a).rvowns (gstepf(gs, ls, D15, a).vretRefs(gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].deqID.tid, gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).vhead].next].val), lstepf(gs, ls, D15, a).success → lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).vrvHp[lstepf(gs, ls, D15, a).rvref] ∧ lstepf(gs, ls, D15, a).optval = gstepf(gs, ls, D15, a).prvHp[lstepf(gs, ls, D15, a).rvref], gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last ∨ gstepf(gs, ls, D15, a).qrl ≠ [] ∧ gstepf(gs, ls, D15, a).vtail = (gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl.butlast).last ∧ gstepf(gs, ls, D15, a).vs[gstepf(gs, ls, D15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D15, a).vs[(gstepf(gs, ls, D15, a).orl + gstepf(gs, ls, D15, a).qrl).last].next = null, gstepf(gs, ls, D15, a).orl.last = gstepf(gs, ls, D15, a).vhead ∧ (gstepf(gs, ls, D15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D15, a).qrl.tail, gstepf(gs, ls, D15, a).vs)) ∨ gstepf(gs, ls, D15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D15, a).orl.butlast.last = gstepf(gs, ls, D15, a).vhead ∧ gstepf(gs, ls, D15, a).phead ≠ gstepf(gs, ls, D15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D15, a).qrl, gstepf(gs, ls, D15, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D15, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.optval:= optval).optval = optval; (s) ⊦ (ls.optval:= optval).rvref = ls.rvref; (s) ⊦ (ls.success:= success).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D15, τ) = gs; (s) ⊦ lstepf(gs, ls, D15, τ) = (ls.success:= true).optval:= Empty; (s) ⊦ (ls.optval:= optval).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 286 from proof copied-step-DMSQLInv (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 287 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D16, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 288 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = pcstepf(gs, ls, D16, a), DMSQGInv(gs), DMSQLInv(gs, ls, D16), pre(gs, ls, D16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D16, seq: ⊦ pcstepf(gs, ls, D16, a) = D17, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 289 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D16, a) = D17

A spec-lemma

Proof step 290 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, DMSQGInv(gs), DMSQLInv(gs, ls, D16), pre(gs, ls, D16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D16-D17, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok (gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv (gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv (gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs [gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs (gstepf(gs, ls, D16, a).vs [gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D16, a).vs [gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D16, a).vs [gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ ( gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = ( gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast ).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D16, a).vs [(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid (lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 291 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid (lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns)

Lemma step-D16-D17

Proof step 292 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, DMSQGInv(gs), DMSQLInv(gs, ls, D16), pre(gs, ls, D16, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17 → ( lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next ∧ lstepf(gs, ls, D16, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps) ∧ markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs) ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps) ∧ gstepf(gs, ls, D16, a).orl ≠ [] ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl ∧ rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns) ∧ allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp) ∧ dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp ∧ ( gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs)) ∧ ( gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D16, a).success ∧ gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid)) ∧ ( gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref ∧ lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp ∧ lstepf(gs, ls, D16, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 293 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, DMSQGInv(gs), DMSQLInv(gs, ls, D16), pre(gs, ls, D16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 294 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 295 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, gs.orl ≠ [], DMSQLInv(gs, ls, D16), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D16, a) ∧ pcstepf(gs, ls, D16, a) = D17, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D16], <all paths>

Additional information

Used simplifier rules: ⊦ D16 ≠ crashed; (s) ⊦ D16 ≠ idle; (s) ⊦ D16 ≠ ready; (s) ⊦ D16 ≠ E1; (s) ⊦ D16 ≠ E17; (s) ⊦ D1 ≠ D16; (s) ⊦ D2 ≠ D16; (s) ⊦ D7 ≠ D16; (s) ⊦ D16 ≠ E4; (s) ⊦ D16 ≠ E16; (s) ⊦ D16 ≠ E15; (s) ⊦ D16 ≠ E14; (s) ⊦ D16 ≠ E13; (s) ⊦ D16 ≠ E12; (s) ⊦ D16 ≠ E11; (s) ⊦ D16 ≠ E10; (s) ⊦ D16 ≠ E9; (s) ⊦ D16 ≠ E8; (s) ⊦ D16 ≠ E7; (s) ⊦ D16 ≠ E6; (s) ⊦ D16 ≠ E5; (s) ⊦ D16 ≠ E3; (s) ⊦ D16 ≠ E2; (s) ⊦ D16 ≠ D34; (s) ⊦ D16 ≠ D31; (s) ⊦ D16 ≠ D30; (s) ⊦ D16 ≠ D29; (s) ⊦ D16 ≠ D28; (s) ⊦ D16 ≠ D27; (s) ⊦ D16 ≠ D26; (s) ⊦ D16 ≠ D25; (s) ⊦ D16 ≠ D24; (s) ⊦ D16 ≠ D23; (s) ⊦ D16 ≠ D22; (s) ⊦ D16 ≠ D21; (s) ⊦ D16 ≠ D20; (s) ⊦ D16 ≠ D19; (s) ⊦ D16 ≠ D18; (s) ⊦ D16 ≠ D17; (s) ⊦ D15 ≠ D16; (s) ⊦ D14 ≠ D16; (s) ⊦ D13 ≠ D16; (s) ⊦ D12 ≠ D16; (s) ⊦ D11 ≠ D16; (s) ⊦ D10 ≠ D16; (s) ⊦ D9 ≠ D16; (s) ⊦ D8 ≠ D16; (s) ⊦ D6 ≠ D16; (s) ⊦ D5 ≠ D16; (s) ⊦ D4 ≠ D16; (s) ⊦ D3 ≠ D16; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, D16, a) = D17; (s) Used terms: gs, ls, D16

Proof step 296 from proof copied-step-DMSQLInv (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 297 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next, lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next, gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref, gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid), gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref, dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp, gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, lstepf(gs, ls, D16, a).nxt ≠ null, gstepf(gs, ls, D16, a).orl ≠ [], lstepf(gs, ls, D16, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D16), allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp), allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp), listp(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns), markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps), markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs), nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs), noid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs), nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs), noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns), pre(gs, ls, D16, a), rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns), rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns), unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps), lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl, lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp, ¬ lstepf(gs, ls, D16, a).success, ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl), gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val), gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs), gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 298 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 299 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).vs[lstepf(gs, ls, D16, a).lst].next, lstepf(gs, ls, D16, a).nxt = gstepf(gs, ls, D16, a).ps[lstepf(gs, ls, D16, a).lst].next, gstepf(gs, ls, D16, a).pretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref, gstepf(gs, ls, D16, a).rvowns(gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid)) = Pending(lstepf(gs, ls, D16, a).tid), gstepf(gs, ls, D16, a).vretRefs(lstepf(gs, ls, D16, a).tid) = lstepf(gs, ls, D16, a).rvref, dom gstepf(gs, ls, D16, a).vrvHp = dom gstepf(gs, ls, D16, a).prvHp, gs0 = gstepf(gs, ls, D16, a), ls0 = lstepf(gs, ls, D16, a), pc0 = D17, lstepf(gs, ls, D16, a).nxt ≠ null, gstepf(gs, ls, D16, a).orl ≠ [], lstepf(gs, ls, D16, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D16), allocrv(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp), allocrv(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp), listp(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns), markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).vs), markedp(gstepf(gs, ls, D16, a).orl, gstepf(gs, ls, D16, a).ps), nextnottid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs), noid(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs), nonullRetRefs (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).pretRefs), noowns(lstepf(gs, ls, D16, a).tid, gstepf(gs, ls, D16, a).owns), pre(gs, ls, D16, a), rvownerok(gstepf(gs, ls, D16, a).pretRefs, gstepf(gs, ls, D16, a).prvHp, gstepf(gs, ls, D16, a).rvowns), rvownerok(gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).rvowns), unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).ps), lstepf(gs, ls, D16, a).rvref ∈ gstepf(gs, ls, D16, a).vrvHp, gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl, lstepf(gs, ls, D16, a).lst ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, ¬ lstepf(gs, ls, D16, a).success, ¬ dups(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl), gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next ≠ null ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D16, a).rvowns (gstepf(gs, ls, D16, a).vretRefs(gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].deqID.tid, gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).vhead].next].val), gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last ∨ gstepf(gs, ls, D16, a).qrl ≠ [] ∧ gstepf(gs, ls, D16, a).vtail = (gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl.butlast).last ∧ gstepf(gs, ls, D16, a).vs[gstepf(gs, ls, D16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D16, a).vs[(gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl).last].next = null, gstepf(gs, ls, D16, a).orl.last = gstepf(gs, ls, D16, a).vhead ∧ (gstepf(gs, ls, D16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D16, a).qrl.tail, gstepf(gs, ls, D16, a).vs)) ∨ gstepf(gs, ls, D16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D16, a).orl.butlast.last = gstepf(gs, ls, D16, a).vhead ∧ gstepf(gs, ls, D16, a).phead ≠ gstepf(gs, ls, D16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D16, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ D17 ≠ D31; (s) ⊦ D17 ≠ D34; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ D17 ≠ D25; (s) ⊦ D17 ≠ D26; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ D17 ≠ D27; (s) ⊦ D17 ≠ D28; (s) ⊦ D17 ≠ D29; (s) ⊦ D17 ≠ D30; (s) ⊦ D17 ≠ D20; (s) ⊦ D17 ≠ D21; (s) ⊦ D17 ≠ E1; (s) ⊦ D17 ≠ E12; (s) ⊦ D17 ≠ E17; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ D17 ≠ D18; (s) ⊦ D17 ≠ D19; (s) ⊦ D17 ≠ D22; (s) ⊦ D17 ≠ D23; (s) ⊦ D17 ≠ D24; (s) ⊦ D17 ≠ crashed; (s) ⊦ D17 ≠ idle; (s) ⊦ D17 ≠ ready; (s) ⊦ D1 ≠ D17; (s) ⊦ D2 ≠ D17; (s) ⊦ D3 ≠ D17; (s) ⊦ D4 ≠ D17; (s) ⊦ D5 ≠ D17; (s) ⊦ D6 ≠ D17; (s) ⊦ D7 ≠ D17; (s) ⊦ D8 ≠ D17; (s) ⊦ D9 ≠ D17; (s) ⊦ D10 ≠ D17; (s) ⊦ D11 ≠ D17; (s) ⊦ D12 ≠ D17; (s) ⊦ D13 ≠ D17; (s) ⊦ D14 ≠ D17; (s) ⊦ D15 ≠ D17; (s) ⊦ D16 ≠ D17; (s) ⊦ gstepf(gs, ls, D16, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + ls.nxt;gs.qrl)) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(ls.nxt; None);gs.owns); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ D17 ≠ E2; (s) ⊦ D17 ≠ E3; (s) ⊦ D17 ≠ E5; (s) ⊦ D17 ≠ E6; (s) ⊦ D17 ≠ E7; (s) ⊦ D17 ≠ E8; (s) ⊦ D17 ≠ E9; (s) ⊦ D17 ≠ E13; (s) ⊦ D17 ≠ E14; (s) ⊦ D17 ≠ E15; (s) ⊦ D17 ≠ E16; (s) ⊦ D17 ≠ E10; (s) ⊦ D17 ≠ E11; (s) ⊦ D17 ≠ E4; (s) ⊦ lstepf(gs, ls, D16, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 300 from proof copied-step-DMSQLInv (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 301 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D17, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 302 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = pcstepf(gs, ls, D17, a), DMSQGInv(gs), DMSQLInv(gs, ls, D17), pre(gs, ls, D17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D17, seq: ⊦ pcstepf(gs, ls, D17, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 303 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D17, a) = D6

A spec-lemma

Proof step 304 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D17), pre(gs, ls, D17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D17-D6, seq:⊦ ( ( ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → ( ( lstepf(gs, ls, D17, a).success → lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).vrvHp[lstepf(gs, ls, D17, a).rvref] ∧ lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).prvHp[lstepf(gs, ls, D17, a).rvref]) ∧ gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid)) = ( lstepf(gs, ls, D17, a).optval = Empty ∨ ¬ lstepf(gs, ls, D17, a).success ⊃ Pending(lstepf(gs, ls, D17, a).tid) ;Claimed (lstepf(gs, ls, D17, a).tid, lstepf(gs, ls, D17, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ ¬ dups(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).ps) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).vs) ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).ps) ∧ gstepf(gs, ls, D17, a).orl ≠ [] ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl ∧ rvownerok (gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv (gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv (gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp) ∧ dom gstepf(gs, ls, D17, a).vrvHp = dom gstepf(gs, ls, D17, a).prvHp ∧ ( gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ≠ null ∧ gstepf(gs, ls, D17, a).vs [gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs (gstepf(gs, ls, D17, a).vs [gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D17, a).vs [gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D17, a).vs [gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D17, a).orl.last = gstepf(gs, ls, D17, a).vhead ∧ ( gstepf(gs, ls, D17, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D17, a).qrl.tail, gstepf(gs, ls, D17, a).vs)) ∨ gstepf(gs, ls, D17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D17, a).orl.butlast.last = gstepf(gs, ls, D17, a).vhead ∧ gstepf(gs, ls, D17, a).phead ≠ gstepf(gs, ls, D17, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs)) ∧ ( gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last ∨ gstepf(gs, ls, D17, a).qrl ≠ [] ∧ gstepf(gs, ls, D17, a).vtail = ( gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl.butlast ).last ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D17, a).vs [(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ gstepf(gs, ls, D17, a).pretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ lstepf(gs, ls, D17, a).rvref ∈ gstepf(gs, ls, D17, a).vrvHp ∧ lstepf(gs, ls, D17, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noid (lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noowns(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 305 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → ( ( lstepf(gs, ls, D17, a).success → lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).vrvHp[lstepf(gs, ls, D17, a).rvref] ∧ lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).prvHp[lstepf(gs, ls, D17, a).rvref]) ∧ gstepf(gs, ls, D17, a).rvowns(gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid)) = (lstepf(gs, ls, D17, a).optval = Empty ∨ ¬ lstepf(gs, ls, D17, a).success ⊃ Pending(lstepf(gs, ls, D17, a).tid) ;Claimed(lstepf(gs, ls, D17, a).tid, lstepf(gs, ls, D17, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ ¬ dups(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).ps) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).vs) ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).ps) ∧ gstepf(gs, ls, D17, a).orl ≠ [] ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl ∧ rvownerok(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp) ∧ dom gstepf(gs, ls, D17, a).vrvHp = dom gstepf(gs, ls, D17, a).prvHp ∧ ( gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ≠ null ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs(gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid, gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D17, a).orl.last = gstepf(gs, ls, D17, a).vhead ∧ (gstepf(gs, ls, D17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D17, a).qrl.tail, gstepf(gs, ls, D17, a).vs)) ∨ gstepf(gs, ls, D17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D17, a).orl.butlast.last = gstepf(gs, ls, D17, a).vhead ∧ gstepf(gs, ls, D17, a).phead ≠ gstepf(gs, ls, D17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs)) ∧ ( gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last ∨ gstepf(gs, ls, D17, a).qrl ≠ [] ∧ gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl.butlast).last ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D17, a).vs[(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ gstepf(gs, ls, D17, a).pretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ lstepf(gs, ls, D17, a).rvref ∈ gstepf(gs, ls, D17, a).vrvHp ∧ lstepf(gs, ls, D17, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noid (lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noowns(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).owns)

Lemma step-D17-D6

Proof step 306 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D17), pre(gs, ls, D17, a), ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6 → ( ( lstepf(gs, ls, D17, a).success → lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).vrvHp[lstepf(gs, ls, D17, a).rvref] ∧ lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).prvHp[lstepf(gs, ls, D17, a).rvref]) ∧ gstepf(gs, ls, D17, a).rvowns(gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid)) = (lstepf(gs, ls, D17, a).optval = Empty ∨ ¬ lstepf(gs, ls, D17, a).success ⊃ Pending(lstepf(gs, ls, D17, a).tid) ;Claimed(lstepf(gs, ls, D17, a).tid, lstepf(gs, ls, D17, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ ¬ dups(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).ps) ∧ markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).vs) ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).ps) ∧ gstepf(gs, ls, D17, a).orl ≠ [] ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl ∧ rvownerok(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp, gstepf(gs, ls, D17, a).rvowns) ∧ allocrv(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp) ∧ dom gstepf(gs, ls, D17, a).vrvHp = dom gstepf(gs, ls, D17, a).prvHp ∧ ( gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ≠ null ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs(gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid, gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D17, a).orl.last = gstepf(gs, ls, D17, a).vhead ∧ (gstepf(gs, ls, D17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D17, a).qrl.tail, gstepf(gs, ls, D17, a).vs)) ∨ gstepf(gs, ls, D17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D17, a).orl.butlast.last = gstepf(gs, ls, D17, a).vhead ∧ gstepf(gs, ls, D17, a).phead ≠ gstepf(gs, ls, D17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs)) ∧ ( gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last ∨ gstepf(gs, ls, D17, a).qrl ≠ [] ∧ gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl.butlast).last ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D17, a).vs[(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ gstepf(gs, ls, D17, a).pretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref ∧ lstepf(gs, ls, D17, a).rvref ∈ gstepf(gs, ls, D17, a).vrvHp ∧ lstepf(gs, ls, D17, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ noowns(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 307 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D17), pre(gs, ls, D17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 308 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 309 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D17), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D17, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D17, a) ∧ pcstepf(gs, ls, D17, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D17], <all paths>

Additional information

Used simplifier rules: ⊦ D17 ≠ crashed; (s) ⊦ D17 ≠ idle; (s) ⊦ D17 ≠ ready; (s) ⊦ D17 ≠ E1; (s) ⊦ D17 ≠ E17; (s) ⊦ D1 ≠ D17; (s) ⊦ D2 ≠ D17; (s) ⊦ D7 ≠ D17; (s) ⊦ D17 ≠ E4; (s) ⊦ D17 ≠ E16; (s) ⊦ D17 ≠ E15; (s) ⊦ D17 ≠ E14; (s) ⊦ D17 ≠ E13; (s) ⊦ D17 ≠ E12; (s) ⊦ D17 ≠ E11; (s) ⊦ D17 ≠ E10; (s) ⊦ D17 ≠ E9; (s) ⊦ D17 ≠ E8; (s) ⊦ D17 ≠ E7; (s) ⊦ D17 ≠ E6; (s) ⊦ D17 ≠ E5; (s) ⊦ D17 ≠ E3; (s) ⊦ D17 ≠ E2; (s) ⊦ D17 ≠ D34; (s) ⊦ D17 ≠ D31; (s) ⊦ D17 ≠ D30; (s) ⊦ D17 ≠ D29; (s) ⊦ D17 ≠ D28; (s) ⊦ D17 ≠ D27; (s) ⊦ D17 ≠ D26; (s) ⊦ D17 ≠ D25; (s) ⊦ D17 ≠ D24; (s) ⊦ D17 ≠ D23; (s) ⊦ D17 ≠ D22; (s) ⊦ D17 ≠ D21; (s) ⊦ D17 ≠ D20; (s) ⊦ D17 ≠ D19; (s) ⊦ D17 ≠ D18; (s) ⊦ D16 ≠ D17; (s) ⊦ D15 ≠ D17; (s) ⊦ D14 ≠ D17; (s) ⊦ D13 ≠ D17; (s) ⊦ D12 ≠ D17; (s) ⊦ D11 ≠ D17; (s) ⊦ D10 ≠ D17; (s) ⊦ D9 ≠ D17; (s) ⊦ D8 ≠ D17; (s) ⊦ D6 ≠ D17; (s) ⊦ D5 ≠ D17; (s) ⊦ D4 ≠ D17; (s) ⊦ D3 ≠ D17; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D17, a) = D6; (s) Used terms: gs, ls, D17

Proof step 310 from proof copied-step-DMSQLInv (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 311 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D17, a).pretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref, gstepf(gs, ls, D17, a).rvowns(gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid)) = (lstepf(gs, ls, D17, a).optval = Empty ∨ ¬ lstepf(gs, ls, D17, a).success ⊃ Pending(lstepf(gs, ls, D17, a).tid) ;Claimed(lstepf(gs, ls, D17, a).tid, lstepf(gs, ls, D17, a).optval.val) ), gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref, dom gstepf(gs, ls, D17, a).vrvHp = dom gstepf(gs, ls, D17, a).prvHp, gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, gstepf(gs, ls, D17, a).orl ≠ [], lstepf(gs, ls, D17, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D17), allocrv(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp), allocrv(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp), listp(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns), markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).ps), markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).vs), nextnottid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs), noid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs), nonullRetRefs (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).pretRefs), noowns(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).owns), pre(gs, ls, D17, a), rvownerok(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).rvowns), rvownerok(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp, gstepf(gs, ls, D17, a).rvowns), unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).ps), gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl, lstepf(gs, ls, D17, a).rvref ∈ gstepf(gs, ls, D17, a).vrvHp, ¬ dups(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl), lstepf(gs, ls, D17, a).success → lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).vrvHp[lstepf(gs, ls, D17, a).rvref] ∧ lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).prvHp[lstepf(gs, ls, D17, a).rvref], gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ≠ null ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs(gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid, gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].val), gstepf(gs, ls, D17, a).orl.last = gstepf(gs, ls, D17, a).vhead ∧ (gstepf(gs, ls, D17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D17, a).qrl.tail, gstepf(gs, ls, D17, a).vs)) ∨ gstepf(gs, ls, D17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D17, a).orl.butlast.last = gstepf(gs, ls, D17, a).vhead ∧ gstepf(gs, ls, D17, a).phead ≠ gstepf(gs, ls, D17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs), gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last ∨ gstepf(gs, ls, D17, a).qrl ≠ [] ∧ gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl.butlast).last ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D17, a).vs[(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 312 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 313 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D17, a).pretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref, gstepf(gs, ls, D17, a).rvowns(gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid)) = (lstepf(gs, ls, D17, a).optval = Empty ∨ ¬ lstepf(gs, ls, D17, a).success ⊃ Pending(lstepf(gs, ls, D17, a).tid) ;Claimed(lstepf(gs, ls, D17, a).tid, lstepf(gs, ls, D17, a).optval.val) ), gstepf(gs, ls, D17, a).vretRefs(lstepf(gs, ls, D17, a).tid) = lstepf(gs, ls, D17, a).rvref, dom gstepf(gs, ls, D17, a).vrvHp = dom gstepf(gs, ls, D17, a).prvHp, gs0 = gstepf(gs, ls, D17, a), ls0 = lstepf(gs, ls, D17, a), pc0 = D6, gstepf(gs, ls, D17, a).orl ≠ [], lstepf(gs, ls, D17, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D17), allocrv(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp), allocrv(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp), listp(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns), markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).vs), markedp(gstepf(gs, ls, D17, a).orl, gstepf(gs, ls, D17, a).ps), nextnottid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs), noid(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs), nonullRetRefs (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).pretRefs), noowns(lstepf(gs, ls, D17, a).tid, gstepf(gs, ls, D17, a).owns), pre(gs, ls, D17, a), rvownerok(gstepf(gs, ls, D17, a).pretRefs, gstepf(gs, ls, D17, a).prvHp, gstepf(gs, ls, D17, a).rvowns), rvownerok(gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).rvowns), unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).ps), lstepf(gs, ls, D17, a).rvref ∈ gstepf(gs, ls, D17, a).vrvHp, gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl, ¬ dups(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl), gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next ≠ null ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D17, a).rvowns (gstepf(gs, ls, D17, a).vretRefs(gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].deqID.tid, gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).vhead].next].val), lstepf(gs, ls, D17, a).success → lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).vrvHp[lstepf(gs, ls, D17, a).rvref] ∧ lstepf(gs, ls, D17, a).optval = gstepf(gs, ls, D17, a).prvHp[lstepf(gs, ls, D17, a).rvref], gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last ∨ gstepf(gs, ls, D17, a).qrl ≠ [] ∧ gstepf(gs, ls, D17, a).vtail = (gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl.butlast).last ∧ gstepf(gs, ls, D17, a).vs[gstepf(gs, ls, D17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D17, a).vs[(gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl).last].next = null, gstepf(gs, ls, D17, a).orl.last = gstepf(gs, ls, D17, a).vhead ∧ (gstepf(gs, ls, D17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D17, a).qrl.tail, gstepf(gs, ls, D17, a).vs)) ∨ gstepf(gs, ls, D17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D17, a).orl.butlast.last = gstepf(gs, ls, D17, a).vhead ∧ gstepf(gs, ls, D17, a).phead ≠ gstepf(gs, ls, D17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D17, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ gstepf(gs, ls, D17, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) ⊦ lstepf(gs, ls, D17, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 314 from proof copied-step-DMSQLInv (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 315 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D18, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 316 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = pcstepf(gs, ls, D18, a), DMSQGInv(gs), DMSQLInv(gs, ls, D18), pre(gs, ls, D18, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D18, seq: ⊦ pcstepf(gs, ls, D18, a) = D19, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 317 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D18, a) = D19

A spec-lemma

Proof step 318 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, DMSQGInv(gs), DMSQLInv(gs, ls, D18), pre(gs, ls, D18, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D18-D19, seq:⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D18, a) ∧ pcstepf(gs, ls, D18, a) = D19 → ( lstepf(gs, ls, D18, a).nxt ≠ null ∧ lstepf(gs, ls, D18, a).nxt = gstepf(gs, ls, D18, a).ps[lstepf(gs, ls, D18, a).first].next ∧ lstepf(gs, ls, D18, a).optval = Val(gstepf(gs, ls, D18, a).vs[lstepf(gs, ls, D18, a).nxt].val)) ∧ ( listp (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).ps, gstepf(gs, ls, D18, a).owns) ∧ ¬ dups(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).ps) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vs) ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).ps) ∧ gstepf(gs, ls, D18, a).orl ≠ [] ∧ gstepf(gs, ls, D18, a).phead ∈ gstepf(gs, ls, D18, a).orl ∧ rvownerok (gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv (gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv (gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp) ∧ dom gstepf(gs, ls, D18, a).vrvHp = dom gstepf(gs, ls, D18, a).prvHp ∧ ( gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ≠ null ∧ gstepf(gs, ls, D18, a).vs [gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs (gstepf(gs, ls, D18, a).vs [gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D18, a).vs [gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D18, a).vs [gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D18, a).orl.last = gstepf(gs, ls, D18, a).vhead ∧ ( gstepf(gs, ls, D18, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D18, a).qrl.tail, gstepf(gs, ls, D18, a).vs)) ∨ gstepf(gs, ls, D18, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D18, a).orl.butlast.last = gstepf(gs, ls, D18, a).vhead ∧ gstepf(gs, ls, D18, a).phead ≠ gstepf(gs, ls, D18, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs)) ∧ ( gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last ∨ gstepf(gs, ls, D18, a).qrl ≠ [] ∧ gstepf(gs, ls, D18, a).vtail = ( gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl.butlast ).last ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D18, a).vs [(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D18, a).success ∧ gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid)) = Pending(lstepf(gs, ls, D18, a).tid)) ∧ ( lstepf(gs, ls, D18, a).first ∈ gstepf(gs, ls, D18, a).orl ∧ gstepf(gs, ls, D18, a).vhead ∈ gstepf(gs, ls, D18, a).orl from lstepf(gs, ls, D18, a).first) ∧ ( lstepf(gs, ls, D18, a).first ≠ lstepf(gs, ls, D18, a).lst ∧ gstepf(gs, ls, D18, a).vtail ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).lst) ∧ lstepf(gs, ls, D18, a).lst ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).first ∧ ( gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ gstepf(gs, ls, D18, a).pretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ lstepf(gs, ls, D18, a).rvref ∈ gstepf(gs, ls, D18, a).vrvHp ∧ lstepf(gs, ls, D18, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).vhead, gstepf(gs, ls, D18, a).vs) ∧ noid (lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vs) ∧ noowns(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 319 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D18, a) ∧ pcstepf(gs, ls, D18, a) = D19 → ( lstepf(gs, ls, D18, a).nxt ≠ null ∧ lstepf(gs, ls, D18, a).nxt = gstepf(gs, ls, D18, a).ps[lstepf(gs, ls, D18, a).first].next ∧ lstepf(gs, ls, D18, a).optval = Val(gstepf(gs, ls, D18, a).vs[lstepf(gs, ls, D18, a).nxt].val)) ∧ ( listp (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).ps, gstepf(gs, ls, D18, a).owns) ∧ ¬ dups(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).ps) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vs) ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).ps) ∧ gstepf(gs, ls, D18, a).orl ≠ [] ∧ gstepf(gs, ls, D18, a).phead ∈ gstepf(gs, ls, D18, a).orl ∧ rvownerok(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp) ∧ dom gstepf(gs, ls, D18, a).vrvHp = dom gstepf(gs, ls, D18, a).prvHp ∧ ( gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ≠ null ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs(gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid, gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D18, a).orl.last = gstepf(gs, ls, D18, a).vhead ∧ (gstepf(gs, ls, D18, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D18, a).qrl.tail, gstepf(gs, ls, D18, a).vs)) ∨ gstepf(gs, ls, D18, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D18, a).orl.butlast.last = gstepf(gs, ls, D18, a).vhead ∧ gstepf(gs, ls, D18, a).phead ≠ gstepf(gs, ls, D18, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs)) ∧ ( gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last ∨ gstepf(gs, ls, D18, a).qrl ≠ [] ∧ gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl.butlast).last ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D18, a).vs[(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D18, a).success ∧ gstepf(gs, ls, D18, a).rvowns(gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid)) = Pending(lstepf(gs, ls, D18, a).tid)) ∧ ( lstepf(gs, ls, D18, a).first ∈ gstepf(gs, ls, D18, a).orl ∧ gstepf(gs, ls, D18, a).vhead ∈ gstepf(gs, ls, D18, a).orl from lstepf(gs, ls, D18, a).first) ∧ ( lstepf(gs, ls, D18, a).first ≠ lstepf(gs, ls, D18, a).lst ∧ gstepf(gs, ls, D18, a).vtail ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).lst) ∧ lstepf(gs, ls, D18, a).lst ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).first ∧ ( gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ gstepf(gs, ls, D18, a).pretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ lstepf(gs, ls, D18, a).rvref ∈ gstepf(gs, ls, D18, a).vrvHp ∧ lstepf(gs, ls, D18, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).vhead, gstepf(gs, ls, D18, a).vs) ∧ noid (lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vs) ∧ noowns(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).owns)

Lemma step-D18-D19

Proof step 320 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, DMSQGInv(gs), DMSQLInv(gs, ls, D18), pre(gs, ls, D18, a), ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D18, a) ∧ pcstepf(gs, ls, D18, a) = D19 → ( lstepf(gs, ls, D18, a).nxt ≠ null ∧ lstepf(gs, ls, D18, a).nxt = gstepf(gs, ls, D18, a).ps[lstepf(gs, ls, D18, a).first].next ∧ lstepf(gs, ls, D18, a).optval = Val(gstepf(gs, ls, D18, a).vs[lstepf(gs, ls, D18, a).nxt].val)) ∧ ( listp (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).ps, gstepf(gs, ls, D18, a).owns) ∧ ¬ dups(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).ps) ∧ markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vs) ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).ps) ∧ gstepf(gs, ls, D18, a).orl ≠ [] ∧ gstepf(gs, ls, D18, a).phead ∈ gstepf(gs, ls, D18, a).orl ∧ rvownerok(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp, gstepf(gs, ls, D18, a).rvowns) ∧ allocrv(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp) ∧ dom gstepf(gs, ls, D18, a).vrvHp = dom gstepf(gs, ls, D18, a).prvHp ∧ ( gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ≠ null ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs(gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid, gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D18, a).orl.last = gstepf(gs, ls, D18, a).vhead ∧ (gstepf(gs, ls, D18, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D18, a).qrl.tail, gstepf(gs, ls, D18, a).vs)) ∨ gstepf(gs, ls, D18, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D18, a).orl.butlast.last = gstepf(gs, ls, D18, a).vhead ∧ gstepf(gs, ls, D18, a).phead ≠ gstepf(gs, ls, D18, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs)) ∧ ( gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last ∨ gstepf(gs, ls, D18, a).qrl ≠ [] ∧ gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl.butlast).last ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D18, a).vs[(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D18, a).success ∧ gstepf(gs, ls, D18, a).rvowns(gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid)) = Pending(lstepf(gs, ls, D18, a).tid)) ∧ ( lstepf(gs, ls, D18, a).first ∈ gstepf(gs, ls, D18, a).orl ∧ gstepf(gs, ls, D18, a).vhead ∈ gstepf(gs, ls, D18, a).orl from lstepf(gs, ls, D18, a).first) ∧ ( lstepf(gs, ls, D18, a).first ≠ lstepf(gs, ls, D18, a).lst ∧ gstepf(gs, ls, D18, a).vtail ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).lst) ∧ lstepf(gs, ls, D18, a).lst ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).first ∧ ( gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ gstepf(gs, ls, D18, a).pretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref ∧ lstepf(gs, ls, D18, a).rvref ∈ gstepf(gs, ls, D18, a).vrvHp ∧ lstepf(gs, ls, D18, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).vhead, gstepf(gs, ls, D18, a).vs) ∧ noid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vs) ∧ noowns(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 321 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, DMSQGInv(gs), DMSQLInv(gs, ls, D18), pre(gs, ls, D18, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D18, a) ∧ pcstepf(gs, ls, D18, a) = D19

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 322 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 323 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, gs.orl ≠ [], DMSQLInv(gs, ls, D18), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D18, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D18, a) ∧ pcstepf(gs, ls, D18, a) = D19, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D18], <all paths>

Additional information

Used simplifier rules: ⊦ D18 ≠ crashed; (s) ⊦ D18 ≠ D32; (s) ⊦ D18 ≠ D33; (s) ⊦ D18 ≠ idle; (s) ⊦ D18 ≠ ready; (s) ⊦ D18 ≠ E1; (s) ⊦ D18 ≠ E17; (s) ⊦ D1 ≠ D18; (s) ⊦ D2 ≠ D18; (s) ⊦ D7 ≠ D18; (s) ⊦ D18 ≠ E4; (s) ⊦ D18 ≠ E16; (s) ⊦ D18 ≠ E15; (s) ⊦ D18 ≠ E14; (s) ⊦ D18 ≠ E13; (s) ⊦ D18 ≠ E12; (s) ⊦ D18 ≠ E11; (s) ⊦ D18 ≠ E10; (s) ⊦ D18 ≠ E9; (s) ⊦ D18 ≠ E8; (s) ⊦ D18 ≠ E7; (s) ⊦ D18 ≠ E6; (s) ⊦ D18 ≠ E5; (s) ⊦ D18 ≠ E3; (s) ⊦ D18 ≠ E2; (s) ⊦ D18 ≠ D34; (s) ⊦ D18 ≠ D31; (s) ⊦ D18 ≠ D30; (s) ⊦ D18 ≠ D29; (s) ⊦ D18 ≠ D28; (s) ⊦ D18 ≠ D27; (s) ⊦ D18 ≠ D26; (s) ⊦ D18 ≠ D25; (s) ⊦ D18 ≠ D24; (s) ⊦ D18 ≠ D23; (s) ⊦ D18 ≠ D22; (s) ⊦ D18 ≠ D21; (s) ⊦ D18 ≠ D20; (s) ⊦ D18 ≠ D19; (s) ⊦ D17 ≠ D18; (s) ⊦ D16 ≠ D18; (s) ⊦ D15 ≠ D18; (s) ⊦ D14 ≠ D18; (s) ⊦ D13 ≠ D18; (s) ⊦ D12 ≠ D18; (s) ⊦ D11 ≠ D18; (s) ⊦ D10 ≠ D18; (s) ⊦ D9 ≠ D18; (s) ⊦ D8 ≠ D18; (s) ⊦ D6 ≠ D18; (s) ⊦ D5 ≠ D18; (s) ⊦ D4 ≠ D18; (s) ⊦ D3 ≠ D18; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D18, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D18, a) = D19; (s) Used terms: gs, ls, D18

Proof step 324 from proof copied-step-DMSQLInv (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 325 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D18, a).nxt = gstepf(gs, ls, D18, a).ps[lstepf(gs, ls, D18, a).first].next, lstepf(gs, ls, D18, a).optval = Val(gstepf(gs, ls, D18, a).vs[lstepf(gs, ls, D18, a).nxt].val), gstepf(gs, ls, D18, a).pretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref, gstepf(gs, ls, D18, a).rvowns(gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid)) = Pending(lstepf(gs, ls, D18, a).tid), gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref, dom gstepf(gs, ls, D18, a).vrvHp = dom gstepf(gs, ls, D18, a).prvHp, gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, lstepf(gs, ls, D18, a).first ≠ lstepf(gs, ls, D18, a).lst, lstepf(gs, ls, D18, a).nxt ≠ null, gstepf(gs, ls, D18, a).orl ≠ [], lstepf(gs, ls, D18, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D18), allocrv(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp), allocrv(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp), listp(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).ps, gstepf(gs, ls, D18, a).owns), markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).ps), markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vs), nextnottid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).vhead, gstepf(gs, ls, D18, a).vs), noid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vs), nonullRetRefs (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).pretRefs), noowns(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).owns), pre(gs, ls, D18, a), rvownerok(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp, gstepf(gs, ls, D18, a).rvowns), rvownerok(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp, gstepf(gs, ls, D18, a).rvowns), unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).ps), gstepf(gs, ls, D18, a).phead ∈ gstepf(gs, ls, D18, a).orl, lstepf(gs, ls, D18, a).first ∈ gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vhead ∈ gstepf(gs, ls, D18, a).orl from lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vtail ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).lst, lstepf(gs, ls, D18, a).lst ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).first, lstepf(gs, ls, D18, a).rvref ∈ gstepf(gs, ls, D18, a).vrvHp, ¬ lstepf(gs, ls, D18, a).success, ¬ dups(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl), gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ≠ null ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs(gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid, gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].val), gstepf(gs, ls, D18, a).orl.last = gstepf(gs, ls, D18, a).vhead ∧ (gstepf(gs, ls, D18, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D18, a).qrl.tail, gstepf(gs, ls, D18, a).vs)) ∨ gstepf(gs, ls, D18, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D18, a).orl.butlast.last = gstepf(gs, ls, D18, a).vhead ∧ gstepf(gs, ls, D18, a).phead ≠ gstepf(gs, ls, D18, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs), gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last ∨ gstepf(gs, ls, D18, a).qrl ≠ [] ∧ gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl.butlast).last ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D18, a).vs[(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 326 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 327 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D18, a).nxt = gstepf(gs, ls, D18, a).ps[lstepf(gs, ls, D18, a).first].next, lstepf(gs, ls, D18, a).optval = Val(gstepf(gs, ls, D18, a).vs[lstepf(gs, ls, D18, a).nxt].val), gstepf(gs, ls, D18, a).pretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref, gstepf(gs, ls, D18, a).rvowns(gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid)) = Pending(lstepf(gs, ls, D18, a).tid), gstepf(gs, ls, D18, a).vretRefs(lstepf(gs, ls, D18, a).tid) = lstepf(gs, ls, D18, a).rvref, dom gstepf(gs, ls, D18, a).vrvHp = dom gstepf(gs, ls, D18, a).prvHp, gs0 = gstepf(gs, ls, D18, a), ls0 = lstepf(gs, ls, D18, a), pc0 = D19, lstepf(gs, ls, D18, a).first ≠ lstepf(gs, ls, D18, a).lst, lstepf(gs, ls, D18, a).nxt ≠ null, gstepf(gs, ls, D18, a).orl ≠ [], lstepf(gs, ls, D18, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D18), allocrv(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp), allocrv(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp), listp(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).ps, gstepf(gs, ls, D18, a).owns), markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).vs), markedp(gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).ps), nextnottid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).vhead, gstepf(gs, ls, D18, a).vs), noid(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vs), nonullRetRefs (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs, gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).pretRefs), noowns(lstepf(gs, ls, D18, a).tid, gstepf(gs, ls, D18, a).owns), pre(gs, ls, D18, a), rvownerok(gstepf(gs, ls, D18, a).pretRefs, gstepf(gs, ls, D18, a).prvHp, gstepf(gs, ls, D18, a).rvowns), rvownerok(gstepf(gs, ls, D18, a).vretRefs, gstepf(gs, ls, D18, a).vrvHp, gstepf(gs, ls, D18, a).rvowns), unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).ps), lstepf(gs, ls, D18, a).rvref ∈ gstepf(gs, ls, D18, a).vrvHp, lstepf(gs, ls, D18, a).lst ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).first, gstepf(gs, ls, D18, a).vtail ∈ gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl from lstepf(gs, ls, D18, a).lst, gstepf(gs, ls, D18, a).vhead ∈ gstepf(gs, ls, D18, a).orl from lstepf(gs, ls, D18, a).first, lstepf(gs, ls, D18, a).first ∈ gstepf(gs, ls, D18, a).orl, gstepf(gs, ls, D18, a).phead ∈ gstepf(gs, ls, D18, a).orl, ¬ lstepf(gs, ls, D18, a).success, ¬ dups(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl), gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next ≠ null ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D18, a).rvowns (gstepf(gs, ls, D18, a).vretRefs(gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].deqID.tid, gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).vhead].next].val), gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last ∨ gstepf(gs, ls, D18, a).qrl ≠ [] ∧ gstepf(gs, ls, D18, a).vtail = (gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl.butlast).last ∧ gstepf(gs, ls, D18, a).vs[gstepf(gs, ls, D18, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D18, a).vs[(gstepf(gs, ls, D18, a).orl + gstepf(gs, ls, D18, a).qrl).last].next = null, gstepf(gs, ls, D18, a).orl.last = gstepf(gs, ls, D18, a).vhead ∧ (gstepf(gs, ls, D18, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D18, a).qrl.tail, gstepf(gs, ls, D18, a).vs)) ∨ gstepf(gs, ls, D18, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D18, a).orl.butlast.last = gstepf(gs, ls, D18, a).vhead ∧ gstepf(gs, ls, D18, a).phead ≠ gstepf(gs, ls, D18, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D18, a).qrl, gstepf(gs, ls, D18, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D18, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D19 ≠ D20; (s) ⊦ D19 ≠ D21; (s) ⊦ D19 ≠ E1; (s) ⊦ D19 ≠ E12; (s) ⊦ D19 ≠ E17; (s) ⊦ D19 ≠ D25; (s) ⊦ D19 ≠ D26; (s) ⊦ D19 ≠ D27; (s) ⊦ D19 ≠ D28; (s) ⊦ D19 ≠ D29; (s) ⊦ D19 ≠ D30; (s) ⊦ D19 ≠ D31; (s) ⊦ D19 ≠ D32; (s) ⊦ D19 ≠ D33; (s) ⊦ D19 ≠ D34; (s) ⊦ D19 ≠ D22; (s) ⊦ D19 ≠ D23; (s) ⊦ D19 ≠ D24; (s) ⊦ D19 ≠ crashed; (s) ⊦ D19 ≠ idle; (s) ⊦ D19 ≠ ready; (s) ⊦ D1 ≠ D19; (s) ⊦ D2 ≠ D19; (s) ⊦ D3 ≠ D19; (s) ⊦ D4 ≠ D19; (s) ⊦ D5 ≠ D19; (s) ⊦ D6 ≠ D19; (s) ⊦ D7 ≠ D19; (s) ⊦ D8 ≠ D19; (s) ⊦ D9 ≠ D19; (s) ⊦ D10 ≠ D19; (s) ⊦ D11 ≠ D19; (s) ⊦ D12 ≠ D19; (s) ⊦ D13 ≠ D19; (s) ⊦ D14 ≠ D19; (s) ⊦ D15 ≠ D19; (s) ⊦ D16 ≠ D19; (s) ⊦ D17 ≠ D19; (s) ⊦ D18 ≠ D19; (s) ⊦ D19 ≠ E2; (s) ⊦ D19 ≠ E3; (s) ⊦ D19 ≠ E5; (s) ⊦ D19 ≠ E6; (s) ⊦ D19 ≠ E7; (s) ⊦ D19 ≠ E8; (s) ⊦ D19 ≠ E9; (s) ⊦ D19 ≠ E13; (s) ⊦ D19 ≠ E14; (s) ⊦ D19 ≠ E15; (s) ⊦ D19 ≠ E16; (s) ⊦ D19 ≠ E10; (s) ⊦ D19 ≠ E11; (s) ⊦ D19 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.optval:= optval).first = ls.first; (s) ⊦ (ls.optval:= optval).optval = optval; (s) ⊦ (ls.optval:= optval).nxt = ls.nxt; (s) ⊦ Val(val) = Val(val0) ↔ val = val0; (s) ⊦ (ls.optval:= optval).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D18, τ) = gs; (s) ⊦ lstepf(gs, ls, D18, τ) = ls.optval:= Val((gs.ps ⊕ gs.vs)[ls.nxt].val); (s) ⊦ (ls.optval:= optval).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 328 from proof copied-step-DMSQLInv (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 329 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D19, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 330 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = pcstepf(gs, ls, D19, a), DMSQGInv(gs), DMSQLInv(gs, ls, D19), pre(gs, ls, D19, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D19, seq: ⊦ pcstepf(gs, ls, D19, a) = D20, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 331 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D19, a) = D20

A spec-lemma

Proof step 332 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, DMSQGInv(gs), DMSQLInv(gs, ls, D19), pre(gs, ls, D19, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D19-D20, seq:⊦ ( ( ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → ( lstepf(gs, ls, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head] .deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed (lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ ( gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt] .deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok (gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv (gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv (gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs [gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs (gstepf(gs, ls, D19, a).vs [gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D19, a).vs [gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D19, a).vs [gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = ( gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast ).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D19, a).vs [(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 333 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → ( lstepf(gs, ls, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns)

Lemma step-D19-D20

Proof step 334 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, DMSQGInv(gs), DMSQLInv(gs, ls, D19), pre(gs, ls, D19, a), ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20 → ( lstepf(gs, ls, D19, a).nxt ≠ null ∧ lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next ∧ lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val) ∧ ( gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success) ∧ (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid (lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) )) ∧ ( listp (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps) ∧ markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs) ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps) ∧ gstepf(gs, ls, D19, a).orl ≠ [] ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl ∧ rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns) ∧ allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp) ∧ dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp ∧ ( gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs)) ∧ ( gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first) ∧ ( lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst) ∧ lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first ∧ ( gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref ∧ lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp ∧ lstepf(gs, ls, D19, a).rvref ≠ null) ∧ ( gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs)) ∧ noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 335 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, DMSQGInv(gs), DMSQLInv(gs, ls, D19), pre(gs, ls, D19, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 336 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 337 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, gs.orl ≠ [], DMSQLInv(gs, ls, D19), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D19, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D19, a) ∧ pcstepf(gs, ls, D19, a) = D20, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D19], <all paths>

Additional information

Used simplifier rules: ⊦ D19 ≠ crashed; (s) ⊦ D19 ≠ D32; (s) ⊦ D19 ≠ D33; (s) ⊦ D19 ≠ idle; (s) ⊦ D19 ≠ ready; (s) ⊦ D19 ≠ E1; (s) ⊦ D19 ≠ E17; (s) ⊦ D1 ≠ D19; (s) ⊦ D2 ≠ D19; (s) ⊦ D7 ≠ D19; (s) ⊦ D19 ≠ E4; (s) ⊦ D19 ≠ E16; (s) ⊦ D19 ≠ E15; (s) ⊦ D19 ≠ E14; (s) ⊦ D19 ≠ E13; (s) ⊦ D19 ≠ E12; (s) ⊦ D19 ≠ E11; (s) ⊦ D19 ≠ E10; (s) ⊦ D19 ≠ E9; (s) ⊦ D19 ≠ E8; (s) ⊦ D19 ≠ E7; (s) ⊦ D19 ≠ E6; (s) ⊦ D19 ≠ E5; (s) ⊦ D19 ≠ E3; (s) ⊦ D19 ≠ E2; (s) ⊦ D19 ≠ D34; (s) ⊦ D19 ≠ D31; (s) ⊦ D19 ≠ D30; (s) ⊦ D19 ≠ D29; (s) ⊦ D19 ≠ D28; (s) ⊦ D19 ≠ D27; (s) ⊦ D19 ≠ D26; (s) ⊦ D19 ≠ D25; (s) ⊦ D19 ≠ D24; (s) ⊦ D19 ≠ D23; (s) ⊦ D19 ≠ D22; (s) ⊦ D19 ≠ D21; (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D19; (s) ⊦ D17 ≠ D19; (s) ⊦ D16 ≠ D19; (s) ⊦ D15 ≠ D19; (s) ⊦ D14 ≠ D19; (s) ⊦ D13 ≠ D19; (s) ⊦ D12 ≠ D19; (s) ⊦ D11 ≠ D19; (s) ⊦ D10 ≠ D19; (s) ⊦ D9 ≠ D19; (s) ⊦ D8 ≠ D19; (s) ⊦ D6 ≠ D19; (s) ⊦ D5 ≠ D19; (s) ⊦ D4 ≠ D19; (s) ⊦ D3 ≠ D19; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D19, a) = D20; (s) Used terms: gs, ls, D19

Proof step 338 from proof copied-step-DMSQLInv (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 339 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next, lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val), gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref, gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref, dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp, gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst, lstepf(gs, ls, D19, a).nxt ≠ null, gstepf(gs, ls, D19, a).orl ≠ [], lstepf(gs, ls, D19, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D19), allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp), allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp), listp(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns), markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps), markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs), nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs), noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns), pre(gs, ls, D19, a), rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns), rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns), unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps), gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl, lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst, lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first, lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp, ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl), gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val), gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs), (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) ), gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs), gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 340 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 341 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D19, a).nxt = gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).first].next, lstepf(gs, ls, D19, a).optval = Val(gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].val), gstepf(gs, ls, D19, a).pretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref, gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid) = lstepf(gs, ls, D19, a).rvref, dom gstepf(gs, ls, D19, a).vrvHp = dom gstepf(gs, ls, D19, a).prvHp, gs0 = gstepf(gs, ls, D19, a), ls0 = lstepf(gs, ls, D19, a), pc0 = D20, lstepf(gs, ls, D19, a).first ≠ lstepf(gs, ls, D19, a).lst, lstepf(gs, ls, D19, a).nxt ≠ null, gstepf(gs, ls, D19, a).orl ≠ [], lstepf(gs, ls, D19, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D19), allocrv(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp), allocrv(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp), listp(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns), markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).vs), markedp(gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).ps), nonullRetRefs (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).pretRefs), noowns(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).owns), pre(gs, ls, D19, a), rvownerok(gstepf(gs, ls, D19, a).pretRefs, gstepf(gs, ls, D19, a).prvHp, gstepf(gs, ls, D19, a).rvowns), rvownerok(gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp, gstepf(gs, ls, D19, a).rvowns), unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).ps), lstepf(gs, ls, D19, a).rvref ∈ gstepf(gs, ls, D19, a).vrvHp, lstepf(gs, ls, D19, a).lst ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from lstepf(gs, ls, D19, a).lst, gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl from lstepf(gs, ls, D19, a).first, lstepf(gs, ls, D19, a).first ∈ gstepf(gs, ls, D19, a).orl, gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl, ¬ dups(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl), gstepf(gs, ls, D19, a).vhead ≠ lstepf(gs, ls, D19, a).first → nextnottid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs), gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next ≠ null ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D19, a).rvowns (gstepf(gs, ls, D19, a).vretRefs(gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].deqID.tid, gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).vhead].next].val), gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.head].deqID = Some(lstepf(gs, ls, D19, a).tid) → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first ∧ lstepf(gs, ls, D19, a).success, (lstepf(gs, ls, D19, a).success ⊃ gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID = Some(lstepf(gs, ls, D19, a).tid) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Claimed(lstepf(gs, ls, D19, a).tid, lstepf(gs, ls, D19, a).optval.val) ∧ (gstepf(gs, ls, D19, a).ps[lstepf(gs, ls, D19, a).nxt].deqID = None → gstepf(gs, ls, D19, a).vhead = lstepf(gs, ls, D19, a).first) ∧ noid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).nxt, gstepf(gs, ls, D19, a).vs) ; gstepf(gs, ls, D19, a).vs[lstepf(gs, ls, D19, a).nxt].deqID ≠ None ∧ noid(lstepf(gs, ls, D19, a).tid, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, lstepf(gs, ls, D19, a).first, gstepf(gs, ls, D19, a).vs) ∧ gstepf(gs, ls, D19, a).rvowns(gstepf(gs, ls, D19, a).vretRefs(lstepf(gs, ls, D19, a).tid)) = Pending(lstepf(gs, ls, D19, a).tid) ), gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last ∨ gstepf(gs, ls, D19, a).qrl ≠ [] ∧ gstepf(gs, ls, D19, a).vtail = (gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl.butlast).last ∧ gstepf(gs, ls, D19, a).vs[gstepf(gs, ls, D19, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D19, a).vs[(gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl).last].next = null, gstepf(gs, ls, D19, a).orl.last = gstepf(gs, ls, D19, a).vhead ∧ (gstepf(gs, ls, D19, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D19, a).qrl.tail, gstepf(gs, ls, D19, a).vs)) ∨ gstepf(gs, ls, D19, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D19, a).orl.butlast.last = gstepf(gs, ls, D19, a).vhead ∧ gstepf(gs, ls, D19, a).phead ≠ gstepf(gs, ls, D19, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used terms: gs0, ls0, pc0

Proof step 342 from proof copied-step-DMSQLInv (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 343 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ lstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true ;ls.success:= false ); (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ gstepf(gs, ls, D19, a) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]) .rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ); (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D7 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D3 ≠ D20; (s) ⊦ D2 ≠ D20; (s) ⊦ D1 ≠ D20; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ crashed; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ D32; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ E17; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ D21; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D19, a) ↔ a = τ; (s)

Proof step 344 from proof copied-step-DMSQLInv (previous step) (back to tree)

((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ] .next, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).optval = Val (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .pretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref, dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vrvHp = dom ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ≠ null, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl ≠ [], ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ≠ null, ls.tid ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, DMSQGInv(gs), DMSQLInv(gs, ls, D19), allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vrvHp), allocrv (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .prvHp), listp ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .owns), markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps), markedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs), nonullRetRefs ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .pretRefs), noowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .owns), rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vrvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .rvowns), rvownerok (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .pretRefs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .prvHp, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .rvowns), unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .phead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vtail ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vrvHp, ¬ dups (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl), ¬ dups (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl), ¬ dups ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl .head ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ] .next ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ] .next ] .deqID ≠ None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vretRefs (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ] .next ] .deqID .tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ] .next ] .deqID .tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ] .next ] .val), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first → nextnottid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs), (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).success ⊃ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = Some(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref) = Claimed (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .val) ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .ps [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID = None → ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first) ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs) ; ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).nxt ] .deqID ≠ None ∧ noid (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs) ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .rvowns (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).rvref) = Pending(((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).tid) ), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ∧ ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl ≠ [] → unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl .tail, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs)) ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl .butlast ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl .butlast .last = ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vhead ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .phead ≠ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl .last ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs), ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl ).last ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl + ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl .butlast ).last ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl .last ] .deqID = None ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .vs [((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl .last ] .next = null, ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .orl from ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).first ∨ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ (gs.vs:= gs.vs[ls.nxt, gs.vs[ls.nxt].deqID:= Some(ls.tid)]).rvowns:= gs.rvowns(gs.vretRefs(ls.tid); Claimed(ls.tid, ls.optval.val)) ;gs ) .qrl ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 1

Additional information

Used simplifier rules: ⊦ (ls.success:= success).optval = ls.optval; (s) ⊦ (ls.success:= success).first = ls.first; (s) ⊦ (ls.success:= success).lst = ls.lst; (s) ⊦ (ls.success:= success).nxt = ls.nxt; (s) ⊦ (ls.success:= success).rvref = ls.rvref; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (gs.rvowns:= rvowns).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.rvowns:= rvowns).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.rvowns:= rvowns).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.rvowns:= rvowns).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.rvowns:= rvowns).vs = gs.vs; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).val = nd.val; (s) ⊦ (gs.rvowns:= rvowns).ps = gs.ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.rvowns:= rvowns).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s)

Proof step 345 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D20, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 346 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = pcstepf(gs, ls, D20, a), DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D20, seq: ⊦ pcstepf(gs, ls, D20, a) = (ls.success ⊃ D21;D25), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 347 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D20, a) = (ls.success ⊃ D21;D25)

A spec-lemma

Proof step 348 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = (ls.success ⊃ D21;D25), DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 349 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D20-D21, seq:⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D21 → ( lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID = Some(lstepf(gs, ls, D20, a).tid) ∧ ( gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).nxt].deqID = None → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, lstepf(gs, ls, D20, a).nxt, gstepf(gs, ls, D20, a).vs) ∧ ( gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.head] .deqID = Some(lstepf(gs, ls, D20, a).tid) → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first)) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok (gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv (gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv (gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs (gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ ( gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = ( gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast ).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D20, a).vs [(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ∈ gstepf(gs, ls, D20, a).vrvHp ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ≠ null ∧ gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Claimed (lstepf(gs, ls, D20, a).tid, lstepf(gs, ls, D20, a).optval.val) ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val)) ∧ ( gstepf(gs, ls, D20, a).vhead ≠ lstepf(gs, ls, D20, a).first → nextnottid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs)) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 350 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D21 → ( lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID = Some(lstepf(gs, ls, D20, a).tid) ∧ (gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).nxt].deqID = None → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, lstepf(gs, ls, D20, a).nxt, gstepf(gs, ls, D20, a).vs) ∧ ( gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.head].deqID = Some(lstepf(gs, ls, D20, a).tid) → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first)) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ∈ gstepf(gs, ls, D20, a).vrvHp ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ≠ null ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Claimed(lstepf(gs, ls, D20, a).tid, lstepf(gs, ls, D20, a).optval.val) ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val)) ∧ ( gstepf(gs, ls, D20, a).vhead ≠ lstepf(gs, ls, D20, a).first → nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs)) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns)

Lemma step-D20-D21

Proof step 351 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a), ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D21 → ( lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID = Some(lstepf(gs, ls, D20, a).tid) ∧ (gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).nxt].deqID = None → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, lstepf(gs, ls, D20, a).nxt, gstepf(gs, ls, D20, a).vs) ∧ ( gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.head].deqID = Some(lstepf(gs, ls, D20, a).tid) → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first)) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ∈ gstepf(gs, ls, D20, a).vrvHp ∧ gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ≠ null ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Claimed(lstepf(gs, ls, D20, a).tid, lstepf(gs, ls, D20, a).optval.val) ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val)) ∧ ( gstepf(gs, ls, D20, a).vhead ≠ lstepf(gs, ls, D20, a).first → nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs)) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 352 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D21

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 353 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 354 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, gs.orl ≠ [], ls.success, DMSQLInv(gs, ls, D20), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D20, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D21, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D20], <all paths>

Additional information

Used simplifier rules: ⊦ D20 ≠ crashed; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ E17; (s) ⊦ D1 ≠ D20; (s) ⊦ D2 ≠ D20; (s) ⊦ D7 ≠ D20; (s) ⊦ D20 ≠ D32; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D3 ≠ D20; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D20, a) = (ls.success ⊃ D21;D25); (s) Used terms: gs, ls, D20

Proof step 355 from proof copied-step-DMSQLInv (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 356 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID = Some(lstepf(gs, ls, D20, a).tid), lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next, lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val), gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Claimed(lstepf(gs, ls, D20, a).tid, lstepf(gs, ls, D20, a).optval.val), gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).nxt ≠ null, gstepf(gs, ls, D20, a).orl ≠ [], lstepf(gs, ls, D20, a).rvref ≠ null, gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ≠ null, ls.success, lstepf(gs, ls, D20, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D20), allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp), allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp), listp(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs), noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, lstepf(gs, ls, D20, a).nxt, gstepf(gs, ls, D20, a).vs), nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs), noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), pre(gs, ls, D20, a), rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns), rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns), unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps), lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first, lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ∈ gstepf(gs, ls, D20, a).vrvHp, ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl), gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).nxt].deqID = None → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.head].deqID = Some(lstepf(gs, ls, D20, a).tid) → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val), gstepf(gs, ls, D20, a).vhead ≠ lstepf(gs, ls, D20, a).first → nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs), gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 357 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 358 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID = Some(lstepf(gs, ls, D20, a).tid), lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next, lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val), gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Claimed(lstepf(gs, ls, D20, a).tid, lstepf(gs, ls, D20, a).optval.val), gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D21, lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).nxt ≠ null, gstepf(gs, ls, D20, a).orl ≠ [], lstepf(gs, ls, D20, a).rvref ≠ null, gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ≠ null, lstepf(gs, ls, D20, a).success, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, D20), allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp), allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp), listp(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps), noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, lstepf(gs, ls, D20, a).nxt, gstepf(gs, ls, D20, a).vs), nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs), noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), pre(gs, ls, D20, a), rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns), rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns), unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps), gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) ∈ gstepf(gs, ls, D20, a).vrvHp, lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp, lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst, gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl, lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl, ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl), gstepf(gs, ls, D20, a).vhead ≠ lstepf(gs, ls, D20, a).first → nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val), gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.head].deqID = Some(lstepf(gs, ls, D20, a).tid) → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).nxt].deqID = None → gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null, gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E17; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D32; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ D22; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ crashed; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ ready; (s) ⊦ D1 ≠ D21; (s) ⊦ D2 ≠ D21; (s) ⊦ D3 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D7 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D20 ≠ D21; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ Val(val).val = val; (s) ⊦ gstepf(gs, ls, D20, τ) = gs; (s) ⊦ lstepf(gs, ls, D20, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 359 from proof copied-step-DMSQLInv (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 360 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D20-D25, seq:⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25 → ( lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val) ∧ ( gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs ((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs )[lstepf(gs, ls, D20, a).nxt ] .deqID .tid)) = Claimed ((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs )[lstepf(gs, ls, D20, a).nxt ] .deqID .tid, lstepf(gs, ls, D20, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok (gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv (gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv (gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs (gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D20, a).vs [gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ ( gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = ( gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast ).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D20, a).vs [(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 361 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25 → ( lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val) ∧ ( gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed ((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns)

Lemma step-D20-D25

Proof step 362 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a), ¬ ls.success, ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25 → ( lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val) ∧ ( gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 363 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, DMSQGInv(gs), DMSQLInv(gs, ls, D20), pre(gs, ls, D20, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 364 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 365 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, gs.orl ≠ [], DMSQLInv(gs, ls, D20), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D20, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D20], <all paths>

Additional information

Used simplifier rules: ⊦ D20 ≠ crashed; (s) ⊦ D20 ≠ idle; (s) ⊦ D20 ≠ ready; (s) ⊦ D20 ≠ E1; (s) ⊦ D20 ≠ E17; (s) ⊦ D1 ≠ D20; (s) ⊦ D2 ≠ D20; (s) ⊦ D7 ≠ D20; (s) ⊦ D20 ≠ D32; (s) ⊦ D20 ≠ D33; (s) ⊦ D20 ≠ E4; (s) ⊦ D20 ≠ E16; (s) ⊦ D20 ≠ E15; (s) ⊦ D20 ≠ E14; (s) ⊦ D20 ≠ E13; (s) ⊦ D20 ≠ E12; (s) ⊦ D20 ≠ E11; (s) ⊦ D20 ≠ E10; (s) ⊦ D20 ≠ E9; (s) ⊦ D20 ≠ E8; (s) ⊦ D20 ≠ E7; (s) ⊦ D20 ≠ E6; (s) ⊦ D20 ≠ E5; (s) ⊦ D20 ≠ E3; (s) ⊦ D20 ≠ E2; (s) ⊦ D20 ≠ D34; (s) ⊦ D20 ≠ D31; (s) ⊦ D20 ≠ D30; (s) ⊦ D20 ≠ D29; (s) ⊦ D20 ≠ D28; (s) ⊦ D20 ≠ D27; (s) ⊦ D20 ≠ D26; (s) ⊦ D20 ≠ D25; (s) ⊦ D20 ≠ D24; (s) ⊦ D20 ≠ D23; (s) ⊦ D20 ≠ D22; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D20; (s) ⊦ D18 ≠ D20; (s) ⊦ D17 ≠ D20; (s) ⊦ D16 ≠ D20; (s) ⊦ D15 ≠ D20; (s) ⊦ D14 ≠ D20; (s) ⊦ D13 ≠ D20; (s) ⊦ D12 ≠ D20; (s) ⊦ D11 ≠ D20; (s) ⊦ D10 ≠ D20; (s) ⊦ D9 ≠ D20; (s) ⊦ D8 ≠ D20; (s) ⊦ D6 ≠ D20; (s) ⊦ D5 ≠ D20; (s) ⊦ D4 ≠ D20; (s) ⊦ D3 ≠ D20; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D20, a) = (ls.success ⊃ D21;D25); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: gs, ls, D20

Proof step 366 from proof copied-step-DMSQLInv (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 367 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next, lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val), gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid), gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None, lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).nxt ≠ null, gstepf(gs, ls, D20, a).orl ≠ [], lstepf(gs, ls, D20, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D20), allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp), allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp), listp(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs), nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs), noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), pre(gs, ls, D20, a), rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns), rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns), unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps), lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first, lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp, ¬ lstepf(gs, ls, D20, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl), gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val), gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val), gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs), gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 368 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 369 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next, lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val), gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid), gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref, dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp, gs0 = gstepf(gs, ls, D20, a), ls0 = lstepf(gs, ls, D20, a), pc0 = D25, gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None, lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst, lstepf(gs, ls, D20, a).nxt ≠ null, gstepf(gs, ls, D20, a).orl ≠ [], lstepf(gs, ls, D20, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D20), allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp), allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp), listp(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs), markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps), nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs), nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs), noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns), pre(gs, ls, D20, a), rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns), rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns), unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps), lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp, lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first, gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst, gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl, lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl, ¬ lstepf(gs, ls, D20, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl), gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val), gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val), gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null, gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D25 ≠ D26; (s) ⊦ D25 ≠ D31; (s) ⊦ D25 ≠ D34; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D25 ≠ D27; (s) ⊦ D25 ≠ D28; (s) ⊦ D25 ≠ D29; (s) ⊦ D25 ≠ D30; (s) ⊦ D25 ≠ E1; (s) ⊦ D25 ≠ E12; (s) ⊦ D25 ≠ E17; (s) ⊦ D25 ≠ crashed; (s) ⊦ D25 ≠ idle; (s) ⊦ D25 ≠ ready; (s) ⊦ D1 ≠ D25; (s) ⊦ D2 ≠ D25; (s) ⊦ D3 ≠ D25; (s) ⊦ D4 ≠ D25; (s) ⊦ D5 ≠ D25; (s) ⊦ D6 ≠ D25; (s) ⊦ D7 ≠ D25; (s) ⊦ D8 ≠ D25; (s) ⊦ D9 ≠ D25; (s) ⊦ D10 ≠ D25; (s) ⊦ D11 ≠ D25; (s) ⊦ D12 ≠ D25; (s) ⊦ D13 ≠ D25; (s) ⊦ D14 ≠ D25; (s) ⊦ D15 ≠ D25; (s) ⊦ D16 ≠ D25; (s) ⊦ D17 ≠ D25; (s) ⊦ D18 ≠ D25; (s) ⊦ D19 ≠ D25; (s) ⊦ D20 ≠ D25; (s) ⊦ D21 ≠ D25; (s) ⊦ D22 ≠ D25; (s) ⊦ D23 ≠ D25; (s) ⊦ D24 ≠ D25; (s) ⊦ D25 ≠ E2; (s) ⊦ D25 ≠ E3; (s) ⊦ D25 ≠ E5; (s) ⊦ D25 ≠ E6; (s) ⊦ D25 ≠ E7; (s) ⊦ D25 ≠ E8; (s) ⊦ D25 ≠ E9; (s) ⊦ D25 ≠ E13; (s) ⊦ D25 ≠ E14; (s) ⊦ D25 ≠ E15; (s) ⊦ D25 ≠ E16; (s) ⊦ D25 ≠ E10; (s) ⊦ D25 ≠ E11; (s) ⊦ D25 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D20, τ) = gs; (s) ⊦ lstepf(gs, ls, D20, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 370 from proof copied-step-DMSQLInv (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 371 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D21, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 372 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = pcstepf(gs, ls, D21, a), DMSQGInv(gs), DMSQLInv(gs, ls, D21), pre(gs, ls, D21, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D21, seq: ⊦ pcstepf(gs, ls, D21, a) = D22, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 373 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D21, a) = D22

A spec-lemma

Proof step 374 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, DMSQGInv(gs), DMSQLInv(gs, ls, D21), pre(gs, ls, D21, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D21-D22, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → ( gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D21, a).first ∈ gstepf(gs, ls, D21, a).orl ∧ lstepf(gs, ls, D21, a).nxt ≠ null ∧ lstepf(gs, ls, D21, a).nxt = gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).first].next) ∧ ( listp (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ ¬ dups(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).ps) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vs) ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).ps) ∧ gstepf(gs, ls, D21, a).orl ≠ [] ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl ∧ rvownerok (gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv (gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv (gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp) ∧ dom gstepf(gs, ls, D21, a).vrvHp = dom gstepf(gs, ls, D21, a).prvHp ∧ ( gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ≠ null ∧ gstepf(gs, ls, D21, a).vs [gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs (gstepf(gs, ls, D21, a).vs [gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D21, a).vs [gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D21, a).vs [gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D21, a).orl.last = gstepf(gs, ls, D21, a).vhead ∧ ( gstepf(gs, ls, D21, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D21, a).qrl.tail, gstepf(gs, ls, D21, a).vs)) ∨ gstepf(gs, ls, D21, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D21, a).orl.butlast.last = gstepf(gs, ls, D21, a).vhead ∧ gstepf(gs, ls, D21, a).phead ≠ gstepf(gs, ls, D21, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs)) ∧ ( gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last ∨ gstepf(gs, ls, D21, a).qrl ≠ [] ∧ gstepf(gs, ls, D21, a).vtail = ( gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl.butlast ).last ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D21, a).vs [(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, D21, a).first ≠ lstepf(gs, ls, D21, a).lst ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).lst) ∧ lstepf(gs, ls, D21, a).lst ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).first ∧ ( gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ gstepf(gs, ls, D21, a).pretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ lstepf(gs, ls, D21, a).rvref ∈ gstepf(gs, ls, D21, a).vrvHp ∧ lstepf(gs, ls, D21, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D21, a).success ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ∈ gstepf(gs, ls, D21, a).vrvHp ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ≠ null ∧ gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid)) = Claimed (lstepf(gs, ls, D21, a).tid, lstepf(gs, ls, D21, a).optval.val) ∧ lstepf(gs, ls, D21, a).optval = Val(gstepf(gs, ls, D21, a).vs[lstepf(gs, ls, D21, a).nxt].val)) ∧ ( gstepf(gs, ls, D21, a).vhead ≠ lstepf(gs, ls, D21, a).first → nextnottid (lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs)) ∧ noid (lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, lstepf(gs, ls, D21, a).nxt, gstepf(gs, ls, D21, a).vs) ∧ noowns(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 375 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → ( gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D21, a).first ∈ gstepf(gs, ls, D21, a).orl ∧ lstepf(gs, ls, D21, a).nxt ≠ null ∧ lstepf(gs, ls, D21, a).nxt = gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).first].next) ∧ ( listp (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ ¬ dups(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).ps) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vs) ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).ps) ∧ gstepf(gs, ls, D21, a).orl ≠ [] ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl ∧ rvownerok(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp) ∧ dom gstepf(gs, ls, D21, a).vrvHp = dom gstepf(gs, ls, D21, a).prvHp ∧ ( gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ≠ null ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs(gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid, gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D21, a).orl.last = gstepf(gs, ls, D21, a).vhead ∧ (gstepf(gs, ls, D21, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D21, a).qrl.tail, gstepf(gs, ls, D21, a).vs)) ∨ gstepf(gs, ls, D21, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D21, a).orl.butlast.last = gstepf(gs, ls, D21, a).vhead ∧ gstepf(gs, ls, D21, a).phead ≠ gstepf(gs, ls, D21, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs)) ∧ ( gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last ∨ gstepf(gs, ls, D21, a).qrl ≠ [] ∧ gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl.butlast).last ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D21, a).vs[(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D21, a).first ≠ lstepf(gs, ls, D21, a).lst ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).lst) ∧ lstepf(gs, ls, D21, a).lst ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).first ∧ ( gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ gstepf(gs, ls, D21, a).pretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ lstepf(gs, ls, D21, a).rvref ∈ gstepf(gs, ls, D21, a).vrvHp ∧ lstepf(gs, ls, D21, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D21, a).success ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ∈ gstepf(gs, ls, D21, a).vrvHp ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ≠ null ∧ gstepf(gs, ls, D21, a).rvowns(gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid)) = Claimed(lstepf(gs, ls, D21, a).tid, lstepf(gs, ls, D21, a).optval.val) ∧ lstepf(gs, ls, D21, a).optval = Val(gstepf(gs, ls, D21, a).vs[lstepf(gs, ls, D21, a).nxt].val)) ∧ ( gstepf(gs, ls, D21, a).vhead ≠ lstepf(gs, ls, D21, a).first → nextnottid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs)) ∧ noid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, lstepf(gs, ls, D21, a).nxt, gstepf(gs, ls, D21, a).vs) ∧ noowns(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).owns)

Lemma step-D21-D22

Proof step 376 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, DMSQGInv(gs), DMSQLInv(gs, ls, D21), pre(gs, ls, D21, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22 → ( gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D21, a).first ∈ gstepf(gs, ls, D21, a).orl ∧ lstepf(gs, ls, D21, a).nxt ≠ null ∧ lstepf(gs, ls, D21, a).nxt = gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).first].next) ∧ ( listp (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ ¬ dups(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).ps) ∧ markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vs) ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).ps) ∧ gstepf(gs, ls, D21, a).orl ≠ [] ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl ∧ rvownerok(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp, gstepf(gs, ls, D21, a).rvowns) ∧ allocrv(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp) ∧ dom gstepf(gs, ls, D21, a).vrvHp = dom gstepf(gs, ls, D21, a).prvHp ∧ ( gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ≠ null ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs(gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid, gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D21, a).orl.last = gstepf(gs, ls, D21, a).vhead ∧ (gstepf(gs, ls, D21, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D21, a).qrl.tail, gstepf(gs, ls, D21, a).vs)) ∨ gstepf(gs, ls, D21, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D21, a).orl.butlast.last = gstepf(gs, ls, D21, a).vhead ∧ gstepf(gs, ls, D21, a).phead ≠ gstepf(gs, ls, D21, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs)) ∧ ( gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last ∨ gstepf(gs, ls, D21, a).qrl ≠ [] ∧ gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl.butlast).last ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D21, a).vs[(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D21, a).first ≠ lstepf(gs, ls, D21, a).lst ∧ gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).lst) ∧ lstepf(gs, ls, D21, a).lst ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).first ∧ ( gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ gstepf(gs, ls, D21, a).pretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref ∧ lstepf(gs, ls, D21, a).rvref ∈ gstepf(gs, ls, D21, a).vrvHp ∧ lstepf(gs, ls, D21, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D21, a).success ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ∈ gstepf(gs, ls, D21, a).vrvHp ∧ gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ≠ null ∧ gstepf(gs, ls, D21, a).rvowns(gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid)) = Claimed(lstepf(gs, ls, D21, a).tid, lstepf(gs, ls, D21, a).optval.val) ∧ lstepf(gs, ls, D21, a).optval = Val(gstepf(gs, ls, D21, a).vs[lstepf(gs, ls, D21, a).nxt].val)) ∧ ( gstepf(gs, ls, D21, a).vhead ≠ lstepf(gs, ls, D21, a).first → nextnottid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs)) ∧ noid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, lstepf(gs, ls, D21, a).nxt, gstepf(gs, ls, D21, a).vs) ∧ noowns(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 377 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, DMSQGInv(gs), DMSQLInv(gs, ls, D21), pre(gs, ls, D21, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 378 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 379 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, gs.orl ≠ [], DMSQLInv(gs, ls, D21), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D21, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D21, a) ∧ pcstepf(gs, ls, D21, a) = D22, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D21], <all paths>

Additional information

Used simplifier rules: ⊦ D21 ≠ crashed; (s) ⊦ D21 ≠ idle; (s) ⊦ D21 ≠ ready; (s) ⊦ D21 ≠ E1; (s) ⊦ D21 ≠ E17; (s) ⊦ D1 ≠ D21; (s) ⊦ D2 ≠ D21; (s) ⊦ D7 ≠ D21; (s) ⊦ D21 ≠ D32; (s) ⊦ D21 ≠ D33; (s) ⊦ D21 ≠ E4; (s) ⊦ D21 ≠ E16; (s) ⊦ D21 ≠ E15; (s) ⊦ D21 ≠ E14; (s) ⊦ D21 ≠ E13; (s) ⊦ D21 ≠ E12; (s) ⊦ D21 ≠ E11; (s) ⊦ D21 ≠ E10; (s) ⊦ D21 ≠ E9; (s) ⊦ D21 ≠ E8; (s) ⊦ D21 ≠ E7; (s) ⊦ D21 ≠ E6; (s) ⊦ D21 ≠ E5; (s) ⊦ D21 ≠ E3; (s) ⊦ D21 ≠ E2; (s) ⊦ D21 ≠ D34; (s) ⊦ D21 ≠ D31; (s) ⊦ D21 ≠ D30; (s) ⊦ D21 ≠ D29; (s) ⊦ D21 ≠ D28; (s) ⊦ D21 ≠ D27; (s) ⊦ D21 ≠ D26; (s) ⊦ D21 ≠ D25; (s) ⊦ D21 ≠ D24; (s) ⊦ D21 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ D20 ≠ D21; (s) ⊦ D19 ≠ D21; (s) ⊦ D18 ≠ D21; (s) ⊦ D17 ≠ D21; (s) ⊦ D16 ≠ D21; (s) ⊦ D15 ≠ D21; (s) ⊦ D14 ≠ D21; (s) ⊦ D13 ≠ D21; (s) ⊦ D12 ≠ D21; (s) ⊦ D11 ≠ D21; (s) ⊦ D10 ≠ D21; (s) ⊦ D9 ≠ D21; (s) ⊦ D8 ≠ D21; (s) ⊦ D6 ≠ D21; (s) ⊦ D5 ≠ D21; (s) ⊦ D4 ≠ D21; (s) ⊦ D3 ≠ D21; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, D21, a) = D22; (s) Used terms: gs, ls, D21

Proof step 380 from proof copied-step-DMSQLInv (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 381 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D21, a).nxt = gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).first].next, lstepf(gs, ls, D21, a).optval = Val(gstepf(gs, ls, D21, a).vs[lstepf(gs, ls, D21, a).nxt].val), gstepf(gs, ls, D21, a).pretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref, gstepf(gs, ls, D21, a).rvowns(gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid)) = Claimed(lstepf(gs, ls, D21, a).tid, lstepf(gs, ls, D21, a).optval.val), gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref, dom gstepf(gs, ls, D21, a).vrvHp = dom gstepf(gs, ls, D21, a).prvHp, gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).nxt].deqID ≠ None, lstepf(gs, ls, D21, a).first ≠ lstepf(gs, ls, D21, a).lst, lstepf(gs, ls, D21, a).nxt ≠ null, gstepf(gs, ls, D21, a).orl ≠ [], lstepf(gs, ls, D21, a).rvref ≠ null, gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ≠ null, lstepf(gs, ls, D21, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D21), allocrv(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp), allocrv(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp), listp(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns), markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).ps), markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vs), noid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, lstepf(gs, ls, D21, a).nxt, gstepf(gs, ls, D21, a).vs), nonullRetRefs (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).pretRefs), noowns(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).owns), pre(gs, ls, D21, a), rvownerok(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).rvowns), rvownerok(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp, gstepf(gs, ls, D21, a).rvowns), unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).ps), lstepf(gs, ls, D21, a).first ∈ gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).lst, lstepf(gs, ls, D21, a).lst ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).first, lstepf(gs, ls, D21, a).rvref ∈ gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ∈ gstepf(gs, ls, D21, a).vrvHp, ¬ dups(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl), gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ≠ null ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs(gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid, gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].val), gstepf(gs, ls, D21, a).vhead ≠ lstepf(gs, ls, D21, a).first → nextnottid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs), gstepf(gs, ls, D21, a).orl.last = gstepf(gs, ls, D21, a).vhead ∧ (gstepf(gs, ls, D21, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D21, a).qrl.tail, gstepf(gs, ls, D21, a).vs)) ∨ gstepf(gs, ls, D21, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D21, a).orl.butlast.last = gstepf(gs, ls, D21, a).vhead ∧ gstepf(gs, ls, D21, a).phead ≠ gstepf(gs, ls, D21, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs), gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last ∨ gstepf(gs, ls, D21, a).qrl ≠ [] ∧ gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl.butlast).last ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D21, a).vs[(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 382 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 383 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D21, a).nxt = gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).first].next, lstepf(gs, ls, D21, a).optval = Val(gstepf(gs, ls, D21, a).vs[lstepf(gs, ls, D21, a).nxt].val), gstepf(gs, ls, D21, a).pretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref, gstepf(gs, ls, D21, a).rvowns(gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid)) = Claimed(lstepf(gs, ls, D21, a).tid, lstepf(gs, ls, D21, a).optval.val), gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) = lstepf(gs, ls, D21, a).rvref, dom gstepf(gs, ls, D21, a).vrvHp = dom gstepf(gs, ls, D21, a).prvHp, gs0 = gstepf(gs, ls, D21, a), ls0 = lstepf(gs, ls, D21, a), pc0 = D22, gstepf(gs, ls, D21, a).ps[lstepf(gs, ls, D21, a).nxt].deqID ≠ None, lstepf(gs, ls, D21, a).first ≠ lstepf(gs, ls, D21, a).lst, lstepf(gs, ls, D21, a).nxt ≠ null, gstepf(gs, ls, D21, a).orl ≠ [], lstepf(gs, ls, D21, a).rvref ≠ null, gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ≠ null, lstepf(gs, ls, D21, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D21), allocrv(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp), allocrv(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp), listp(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns), markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).vs), markedp(gstepf(gs, ls, D21, a).orl, gstepf(gs, ls, D21, a).ps), noid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, lstepf(gs, ls, D21, a).nxt, gstepf(gs, ls, D21, a).vs), nonullRetRefs (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).pretRefs), noowns(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).owns), pre(gs, ls, D21, a), rvownerok(gstepf(gs, ls, D21, a).pretRefs, gstepf(gs, ls, D21, a).prvHp, gstepf(gs, ls, D21, a).rvowns), rvownerok(gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp, gstepf(gs, ls, D21, a).rvowns), unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).ps), gstepf(gs, ls, D21, a).vretRefs(lstepf(gs, ls, D21, a).tid) ∈ gstepf(gs, ls, D21, a).vrvHp, lstepf(gs, ls, D21, a).rvref ∈ gstepf(gs, ls, D21, a).vrvHp, lstepf(gs, ls, D21, a).lst ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).first, gstepf(gs, ls, D21, a).vtail ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from lstepf(gs, ls, D21, a).lst, gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl, lstepf(gs, ls, D21, a).first ∈ gstepf(gs, ls, D21, a).orl, ¬ dups(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl), gstepf(gs, ls, D21, a).vhead ≠ lstepf(gs, ls, D21, a).first → nextnottid(lstepf(gs, ls, D21, a).tid, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs), gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next ≠ null ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D21, a).rvowns (gstepf(gs, ls, D21, a).vretRefs(gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].deqID.tid, gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).vhead].next].val), gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last ∨ gstepf(gs, ls, D21, a).qrl ≠ [] ∧ gstepf(gs, ls, D21, a).vtail = (gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl.butlast).last ∧ gstepf(gs, ls, D21, a).vs[gstepf(gs, ls, D21, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D21, a).vs[(gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl).last].next = null, gstepf(gs, ls, D21, a).orl.last = gstepf(gs, ls, D21, a).vhead ∧ (gstepf(gs, ls, D21, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D21, a).qrl.tail, gstepf(gs, ls, D21, a).vs)) ∨ gstepf(gs, ls, D21, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D21, a).orl.butlast.last = gstepf(gs, ls, D21, a).vhead ∧ gstepf(gs, ls, D21, a).phead ≠ gstepf(gs, ls, D21, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D21, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.tid);τ); (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ D22 ≠ D23; (s) ⊦ D22 ≠ D24; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ D22 ≠ E1; (s) ⊦ D22 ≠ E12; (s) ⊦ D22 ≠ E17; (s) ⊦ D22 ≠ D25; (s) ⊦ D22 ≠ D26; (s) ⊦ D22 ≠ D27; (s) ⊦ D22 ≠ D28; (s) ⊦ D22 ≠ D29; (s) ⊦ D22 ≠ D30; (s) ⊦ D22 ≠ D31; (s) ⊦ D22 ≠ D32; (s) ⊦ D22 ≠ D33; (s) ⊦ D22 ≠ D34; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ D22 ≠ crashed; (s) ⊦ D22 ≠ idle; (s) ⊦ D22 ≠ ready; (s) ⊦ D1 ≠ D22; (s) ⊦ D2 ≠ D22; (s) ⊦ D3 ≠ D22; (s) ⊦ D4 ≠ D22; (s) ⊦ D5 ≠ D22; (s) ⊦ D6 ≠ D22; (s) ⊦ D7 ≠ D22; (s) ⊦ D8 ≠ D22; (s) ⊦ D9 ≠ D22; (s) ⊦ D10 ≠ D22; (s) ⊦ D11 ≠ D22; (s) ⊦ D12 ≠ D22; (s) ⊦ D13 ≠ D22; (s) ⊦ D14 ≠ D22; (s) ⊦ D15 ≠ D22; (s) ⊦ D16 ≠ D22; (s) ⊦ D17 ≠ D22; (s) ⊦ D18 ≠ D22; (s) ⊦ D19 ≠ D22; (s) ⊦ D20 ≠ D22; (s) ⊦ D21 ≠ D22; (s) ⊦ gstepf(gs, ls, D21, a) = ( ( gs .ps:= gs.ps [ls.nxt, gs.ps[ls.nxt].deqID:= gs.vs[ls.nxt].deqID ]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ D22 ≠ E2; (s) ⊦ D22 ≠ E3; (s) ⊦ D22 ≠ E5; (s) ⊦ D22 ≠ E6; (s) ⊦ D22 ≠ E7; (s) ⊦ D22 ≠ E8; (s) ⊦ D22 ≠ E9; (s) ⊦ D22 ≠ E13; (s) ⊦ D22 ≠ E14; (s) ⊦ D22 ≠ E15; (s) ⊦ D22 ≠ E16; (s) ⊦ D22 ≠ E10; (s) ⊦ D22 ≠ E11; (s) ⊦ D22 ≠ E4; (s) ⊦ lstepf(gs, ls, D21, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 384 from proof copied-step-DMSQLInv (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 385 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D22, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 386 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = pcstepf(gs, ls, D22, a), DMSQGInv(gs), DMSQLInv(gs, ls, D22), pre(gs, ls, D22, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D22, seq: ⊦ pcstepf(gs, ls, D22, a) = D23, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 387 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D22, a) = D23

A spec-lemma

Proof step 388 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, DMSQGInv(gs), DMSQLInv(gs, ls, D22), pre(gs, ls, D22, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D22-D23, seq:⊦ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → ( gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D22, a).first ∈ gstepf(gs, ls, D22, a).orl ∧ lstepf(gs, ls, D22, a).nxt ≠ null ∧ lstepf(gs, ls, D22, a).nxt = gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).first].next ∧ lstepf(gs, ls, D22, a).optval = gstepf(gs, ls, D22, a).vrvHp[lstepf(gs, ls, D22, a).rvref]) ∧ ( listp (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ ¬ dups(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).ps) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vs) ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).ps) ∧ gstepf(gs, ls, D22, a).orl ≠ [] ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl ∧ rvownerok (gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv (gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv (gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp) ∧ dom gstepf(gs, ls, D22, a).vrvHp = dom gstepf(gs, ls, D22, a).prvHp ∧ ( gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ≠ null ∧ gstepf(gs, ls, D22, a).vs [gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs (gstepf(gs, ls, D22, a).vs [gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D22, a).vs [gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D22, a).vs [gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D22, a).orl.last = gstepf(gs, ls, D22, a).vhead ∧ ( gstepf(gs, ls, D22, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D22, a).qrl.tail, gstepf(gs, ls, D22, a).vs)) ∨ gstepf(gs, ls, D22, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D22, a).orl.butlast.last = gstepf(gs, ls, D22, a).vhead ∧ gstepf(gs, ls, D22, a).phead ≠ gstepf(gs, ls, D22, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs)) ∧ ( gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last ∨ gstepf(gs, ls, D22, a).qrl ≠ [] ∧ gstepf(gs, ls, D22, a).vtail = ( gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl.butlast ).last ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D22, a).vs [(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, D22, a).first ≠ lstepf(gs, ls, D22, a).lst ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).lst) ∧ lstepf(gs, ls, D22, a).lst ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).first ∧ ( gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ gstepf(gs, ls, D22, a).pretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ lstepf(gs, ls, D22, a).rvref ∈ gstepf(gs, ls, D22, a).vrvHp ∧ lstepf(gs, ls, D22, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D22, a).success ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ∈ gstepf(gs, ls, D22, a).vrvHp ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ≠ null ∧ gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid)) = Claimed (lstepf(gs, ls, D22, a).tid, lstepf(gs, ls, D22, a).optval.val) ∧ lstepf(gs, ls, D22, a).optval = Val(gstepf(gs, ls, D22, a).vs[lstepf(gs, ls, D22, a).nxt].val)) ∧ ( gstepf(gs, ls, D22, a).vhead ≠ lstepf(gs, ls, D22, a).first → nextnottid (lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs)) ∧ noid (lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, lstepf(gs, ls, D22, a).nxt, gstepf(gs, ls, D22, a).vs) ∧ noowns(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 389 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → ( gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D22, a).first ∈ gstepf(gs, ls, D22, a).orl ∧ lstepf(gs, ls, D22, a).nxt ≠ null ∧ lstepf(gs, ls, D22, a).nxt = gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).first].next ∧ lstepf(gs, ls, D22, a).optval = gstepf(gs, ls, D22, a).vrvHp[lstepf(gs, ls, D22, a).rvref]) ∧ ( listp (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ ¬ dups(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).ps) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vs) ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).ps) ∧ gstepf(gs, ls, D22, a).orl ≠ [] ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl ∧ rvownerok(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp) ∧ dom gstepf(gs, ls, D22, a).vrvHp = dom gstepf(gs, ls, D22, a).prvHp ∧ ( gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ≠ null ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs(gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid, gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D22, a).orl.last = gstepf(gs, ls, D22, a).vhead ∧ (gstepf(gs, ls, D22, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D22, a).qrl.tail, gstepf(gs, ls, D22, a).vs)) ∨ gstepf(gs, ls, D22, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D22, a).orl.butlast.last = gstepf(gs, ls, D22, a).vhead ∧ gstepf(gs, ls, D22, a).phead ≠ gstepf(gs, ls, D22, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs)) ∧ ( gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last ∨ gstepf(gs, ls, D22, a).qrl ≠ [] ∧ gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl.butlast).last ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D22, a).vs[(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D22, a).first ≠ lstepf(gs, ls, D22, a).lst ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).lst) ∧ lstepf(gs, ls, D22, a).lst ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).first ∧ ( gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ gstepf(gs, ls, D22, a).pretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ lstepf(gs, ls, D22, a).rvref ∈ gstepf(gs, ls, D22, a).vrvHp ∧ lstepf(gs, ls, D22, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D22, a).success ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ∈ gstepf(gs, ls, D22, a).vrvHp ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ≠ null ∧ gstepf(gs, ls, D22, a).rvowns(gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid)) = Claimed(lstepf(gs, ls, D22, a).tid, lstepf(gs, ls, D22, a).optval.val) ∧ lstepf(gs, ls, D22, a).optval = Val(gstepf(gs, ls, D22, a).vs[lstepf(gs, ls, D22, a).nxt].val)) ∧ ( gstepf(gs, ls, D22, a).vhead ≠ lstepf(gs, ls, D22, a).first → nextnottid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs)) ∧ noid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, lstepf(gs, ls, D22, a).nxt, gstepf(gs, ls, D22, a).vs) ∧ noowns(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).owns)

Lemma step-D22-D23

Proof step 390 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, DMSQGInv(gs), DMSQLInv(gs, ls, D22), pre(gs, ls, D22, a), ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23 → ( gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D22, a).first ∈ gstepf(gs, ls, D22, a).orl ∧ lstepf(gs, ls, D22, a).nxt ≠ null ∧ lstepf(gs, ls, D22, a).nxt = gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).first].next ∧ lstepf(gs, ls, D22, a).optval = gstepf(gs, ls, D22, a).vrvHp[lstepf(gs, ls, D22, a).rvref]) ∧ ( listp (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ ¬ dups(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).ps) ∧ markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vs) ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).ps) ∧ gstepf(gs, ls, D22, a).orl ≠ [] ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl ∧ rvownerok(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp, gstepf(gs, ls, D22, a).rvowns) ∧ allocrv(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp) ∧ dom gstepf(gs, ls, D22, a).vrvHp = dom gstepf(gs, ls, D22, a).prvHp ∧ ( gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ≠ null ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs(gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid, gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D22, a).orl.last = gstepf(gs, ls, D22, a).vhead ∧ (gstepf(gs, ls, D22, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D22, a).qrl.tail, gstepf(gs, ls, D22, a).vs)) ∨ gstepf(gs, ls, D22, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D22, a).orl.butlast.last = gstepf(gs, ls, D22, a).vhead ∧ gstepf(gs, ls, D22, a).phead ≠ gstepf(gs, ls, D22, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs)) ∧ ( gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last ∨ gstepf(gs, ls, D22, a).qrl ≠ [] ∧ gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl.butlast).last ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D22, a).vs[(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D22, a).first ≠ lstepf(gs, ls, D22, a).lst ∧ gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).lst) ∧ lstepf(gs, ls, D22, a).lst ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).first ∧ ( gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ gstepf(gs, ls, D22, a).pretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref ∧ lstepf(gs, ls, D22, a).rvref ∈ gstepf(gs, ls, D22, a).vrvHp ∧ lstepf(gs, ls, D22, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D22, a).success ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ∈ gstepf(gs, ls, D22, a).vrvHp ∧ gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ≠ null ∧ gstepf(gs, ls, D22, a).rvowns(gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid)) = Claimed(lstepf(gs, ls, D22, a).tid, lstepf(gs, ls, D22, a).optval.val) ∧ lstepf(gs, ls, D22, a).optval = Val(gstepf(gs, ls, D22, a).vs[lstepf(gs, ls, D22, a).nxt].val)) ∧ ( gstepf(gs, ls, D22, a).vhead ≠ lstepf(gs, ls, D22, a).first → nextnottid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs)) ∧ noid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, lstepf(gs, ls, D22, a).nxt, gstepf(gs, ls, D22, a).vs) ∧ noowns(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 391 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, DMSQGInv(gs), DMSQLInv(gs, ls, D22), pre(gs, ls, D22, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 392 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 393 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, gs.orl ≠ [], DMSQLInv(gs, ls, D22), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D22, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D22, a) ∧ pcstepf(gs, ls, D22, a) = D23, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D22], <all paths>

Additional information

Used simplifier rules: ⊦ D22 ≠ crashed; (s) ⊦ D22 ≠ idle; (s) ⊦ D22 ≠ ready; (s) ⊦ D22 ≠ E1; (s) ⊦ D22 ≠ E17; (s) ⊦ D1 ≠ D22; (s) ⊦ D2 ≠ D22; (s) ⊦ D7 ≠ D22; (s) ⊦ D22 ≠ D32; (s) ⊦ D22 ≠ D33; (s) ⊦ D22 ≠ E4; (s) ⊦ D22 ≠ E16; (s) ⊦ D22 ≠ E15; (s) ⊦ D22 ≠ E14; (s) ⊦ D22 ≠ E13; (s) ⊦ D22 ≠ E12; (s) ⊦ D22 ≠ E11; (s) ⊦ D22 ≠ E10; (s) ⊦ D22 ≠ E9; (s) ⊦ D22 ≠ E8; (s) ⊦ D22 ≠ E7; (s) ⊦ D22 ≠ E6; (s) ⊦ D22 ≠ E5; (s) ⊦ D22 ≠ E3; (s) ⊦ D22 ≠ E2; (s) ⊦ D22 ≠ D34; (s) ⊦ D22 ≠ D31; (s) ⊦ D22 ≠ D30; (s) ⊦ D22 ≠ D29; (s) ⊦ D22 ≠ D28; (s) ⊦ D22 ≠ D27; (s) ⊦ D22 ≠ D26; (s) ⊦ D22 ≠ D25; (s) ⊦ D22 ≠ D24; (s) ⊦ D22 ≠ D23; (s) ⊦ D21 ≠ D22; (s) ⊦ D20 ≠ D22; (s) ⊦ D19 ≠ D22; (s) ⊦ D18 ≠ D22; (s) ⊦ D17 ≠ D22; (s) ⊦ D16 ≠ D22; (s) ⊦ D15 ≠ D22; (s) ⊦ D14 ≠ D22; (s) ⊦ D13 ≠ D22; (s) ⊦ D12 ≠ D22; (s) ⊦ D11 ≠ D22; (s) ⊦ D10 ≠ D22; (s) ⊦ D9 ≠ D22; (s) ⊦ D8 ≠ D22; (s) ⊦ D6 ≠ D22; (s) ⊦ D5 ≠ D22; (s) ⊦ D4 ≠ D22; (s) ⊦ D3 ≠ D22; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D22, a) = D23; (s) Used terms: gs, ls, D22

Proof step 394 from proof copied-step-DMSQLInv (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 395 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D22, a).nxt = gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).first].next, lstepf(gs, ls, D22, a).optval = gstepf(gs, ls, D22, a).vrvHp[lstepf(gs, ls, D22, a).rvref], lstepf(gs, ls, D22, a).optval = Val(gstepf(gs, ls, D22, a).vs[lstepf(gs, ls, D22, a).nxt].val), gstepf(gs, ls, D22, a).pretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref, gstepf(gs, ls, D22, a).rvowns(gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid)) = Claimed(lstepf(gs, ls, D22, a).tid, lstepf(gs, ls, D22, a).optval.val), gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref, dom gstepf(gs, ls, D22, a).vrvHp = dom gstepf(gs, ls, D22, a).prvHp, gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).nxt].deqID ≠ None, lstepf(gs, ls, D22, a).first ≠ lstepf(gs, ls, D22, a).lst, lstepf(gs, ls, D22, a).nxt ≠ null, gstepf(gs, ls, D22, a).orl ≠ [], lstepf(gs, ls, D22, a).rvref ≠ null, gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ≠ null, lstepf(gs, ls, D22, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D22), allocrv(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp), allocrv(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp), listp(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns), markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).ps), markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vs), noid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, lstepf(gs, ls, D22, a).nxt, gstepf(gs, ls, D22, a).vs), nonullRetRefs (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).pretRefs), noowns(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).owns), pre(gs, ls, D22, a), rvownerok(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).rvowns), rvownerok(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp, gstepf(gs, ls, D22, a).rvowns), unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).ps), lstepf(gs, ls, D22, a).first ∈ gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).lst, lstepf(gs, ls, D22, a).lst ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).first, lstepf(gs, ls, D22, a).rvref ∈ gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ∈ gstepf(gs, ls, D22, a).vrvHp, ¬ dups(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl), gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ≠ null ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs(gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid, gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].val), gstepf(gs, ls, D22, a).vhead ≠ lstepf(gs, ls, D22, a).first → nextnottid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs), gstepf(gs, ls, D22, a).orl.last = gstepf(gs, ls, D22, a).vhead ∧ (gstepf(gs, ls, D22, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D22, a).qrl.tail, gstepf(gs, ls, D22, a).vs)) ∨ gstepf(gs, ls, D22, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D22, a).orl.butlast.last = gstepf(gs, ls, D22, a).vhead ∧ gstepf(gs, ls, D22, a).phead ≠ gstepf(gs, ls, D22, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs), gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last ∨ gstepf(gs, ls, D22, a).qrl ≠ [] ∧ gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl.butlast).last ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D22, a).vs[(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 396 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 397 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D22, a).nxt = gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).first].next, lstepf(gs, ls, D22, a).optval = Val(gstepf(gs, ls, D22, a).vs[lstepf(gs, ls, D22, a).nxt].val), lstepf(gs, ls, D22, a).optval = gstepf(gs, ls, D22, a).vrvHp[lstepf(gs, ls, D22, a).rvref], gstepf(gs, ls, D22, a).pretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref, gstepf(gs, ls, D22, a).rvowns(gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid)) = Claimed(lstepf(gs, ls, D22, a).tid, lstepf(gs, ls, D22, a).optval.val), gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) = lstepf(gs, ls, D22, a).rvref, dom gstepf(gs, ls, D22, a).vrvHp = dom gstepf(gs, ls, D22, a).prvHp, gs0 = gstepf(gs, ls, D22, a), ls0 = lstepf(gs, ls, D22, a), pc0 = D23, gstepf(gs, ls, D22, a).ps[lstepf(gs, ls, D22, a).nxt].deqID ≠ None, lstepf(gs, ls, D22, a).first ≠ lstepf(gs, ls, D22, a).lst, lstepf(gs, ls, D22, a).nxt ≠ null, gstepf(gs, ls, D22, a).orl ≠ [], lstepf(gs, ls, D22, a).rvref ≠ null, gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ≠ null, lstepf(gs, ls, D22, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D22), allocrv(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp), allocrv(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp), listp(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns), markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).vs), markedp(gstepf(gs, ls, D22, a).orl, gstepf(gs, ls, D22, a).ps), noid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, lstepf(gs, ls, D22, a).nxt, gstepf(gs, ls, D22, a).vs), nonullRetRefs (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).pretRefs), noowns(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).owns), pre(gs, ls, D22, a), rvownerok(gstepf(gs, ls, D22, a).pretRefs, gstepf(gs, ls, D22, a).prvHp, gstepf(gs, ls, D22, a).rvowns), rvownerok(gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp, gstepf(gs, ls, D22, a).rvowns), unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).ps), gstepf(gs, ls, D22, a).vretRefs(lstepf(gs, ls, D22, a).tid) ∈ gstepf(gs, ls, D22, a).vrvHp, lstepf(gs, ls, D22, a).rvref ∈ gstepf(gs, ls, D22, a).vrvHp, lstepf(gs, ls, D22, a).lst ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).first, gstepf(gs, ls, D22, a).vtail ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from lstepf(gs, ls, D22, a).lst, gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl, lstepf(gs, ls, D22, a).first ∈ gstepf(gs, ls, D22, a).orl, ¬ dups(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl), gstepf(gs, ls, D22, a).vhead ≠ lstepf(gs, ls, D22, a).first → nextnottid(lstepf(gs, ls, D22, a).tid, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs), gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next ≠ null ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D22, a).rvowns (gstepf(gs, ls, D22, a).vretRefs(gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].deqID.tid, gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).vhead].next].val), gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last ∨ gstepf(gs, ls, D22, a).qrl ≠ [] ∧ gstepf(gs, ls, D22, a).vtail = (gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl.butlast).last ∧ gstepf(gs, ls, D22, a).vs[gstepf(gs, ls, D22, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D22, a).vs[(gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl).last].next = null, gstepf(gs, ls, D22, a).orl.last = gstepf(gs, ls, D22, a).vhead ∧ (gstepf(gs, ls, D22, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D22, a).qrl.tail, gstepf(gs, ls, D22, a).vs)) ∨ gstepf(gs, ls, D22, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D22, a).orl.butlast.last = gstepf(gs, ls, D22, a).vhead ∧ gstepf(gs, ls, D22, a).phead ≠ gstepf(gs, ls, D22, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D22, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D23 ≠ D24; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D23 ≠ E1; (s) ⊦ D23 ≠ E12; (s) ⊦ D23 ≠ E17; (s) ⊦ D23 ≠ D25; (s) ⊦ D23 ≠ D26; (s) ⊦ D23 ≠ D27; (s) ⊦ D23 ≠ D28; (s) ⊦ D23 ≠ D29; (s) ⊦ D23 ≠ D30; (s) ⊦ D23 ≠ D31; (s) ⊦ D23 ≠ D32; (s) ⊦ D23 ≠ D33; (s) ⊦ D23 ≠ D34; (s) ⊦ D23 ≠ crashed; (s) ⊦ D23 ≠ idle; (s) ⊦ D23 ≠ ready; (s) ⊦ D1 ≠ D23; (s) ⊦ D2 ≠ D23; (s) ⊦ D3 ≠ D23; (s) ⊦ D4 ≠ D23; (s) ⊦ D5 ≠ D23; (s) ⊦ D6 ≠ D23; (s) ⊦ D7 ≠ D23; (s) ⊦ D8 ≠ D23; (s) ⊦ D9 ≠ D23; (s) ⊦ D10 ≠ D23; (s) ⊦ D11 ≠ D23; (s) ⊦ D12 ≠ D23; (s) ⊦ D13 ≠ D23; (s) ⊦ D14 ≠ D23; (s) ⊦ D15 ≠ D23; (s) ⊦ D16 ≠ D23; (s) ⊦ D17 ≠ D23; (s) ⊦ D18 ≠ D23; (s) ⊦ D19 ≠ D23; (s) ⊦ D20 ≠ D23; (s) ⊦ D21 ≠ D23; (s) ⊦ D22 ≠ D23; (s) ⊦ D23 ≠ E2; (s) ⊦ D23 ≠ E3; (s) ⊦ D23 ≠ E5; (s) ⊦ D23 ≠ E6; (s) ⊦ D23 ≠ E7; (s) ⊦ D23 ≠ E8; (s) ⊦ D23 ≠ E9; (s) ⊦ D23 ≠ E13; (s) ⊦ D23 ≠ E14; (s) ⊦ D23 ≠ E15; (s) ⊦ D23 ≠ E16; (s) ⊦ D23 ≠ E10; (s) ⊦ D23 ≠ E11; (s) ⊦ D23 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ Val(val).val = val; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ gstepf(gs, ls, D22, τ) = gs.vrvHp:= gs.vrvHp[ls.rvref, ls.optval]; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, D22, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 398 from proof copied-step-DMSQLInv (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 399 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D23, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 400 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = pcstepf(gs, ls, D23, a), DMSQGInv(gs), DMSQLInv(gs, ls, D23), pre(gs, ls, D23, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D23, seq: ⊦ pcstepf(gs, ls, D23, a) = D24, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 401 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D23, a) = D24

A spec-lemma

Proof step 402 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, DMSQGInv(gs), DMSQLInv(gs, ls, D23), pre(gs, ls, D23, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D23-D24, seq:⊦ ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → ( gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D23, a).first ∈ gstepf(gs, ls, D23, a).orl ∧ lstepf(gs, ls, D23, a).nxt ≠ null ∧ lstepf(gs, ls, D23, a).nxt = gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).first].next ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).vrvHp[lstepf(gs, ls, D23, a).rvref] ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).prvHp[lstepf(gs, ls, D23, a).rvref]) ∧ ( listp (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ ¬ dups(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).ps) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vs) ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).ps) ∧ gstepf(gs, ls, D23, a).orl ≠ [] ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl ∧ rvownerok (gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv (gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv (gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp) ∧ dom gstepf(gs, ls, D23, a).vrvHp = dom gstepf(gs, ls, D23, a).prvHp ∧ ( gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ≠ null ∧ gstepf(gs, ls, D23, a).vs [gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs (gstepf(gs, ls, D23, a).vs [gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D23, a).vs [gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D23, a).vs [gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D23, a).orl.last = gstepf(gs, ls, D23, a).vhead ∧ ( gstepf(gs, ls, D23, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D23, a).qrl.tail, gstepf(gs, ls, D23, a).vs)) ∨ gstepf(gs, ls, D23, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D23, a).orl.butlast.last = gstepf(gs, ls, D23, a).vhead ∧ gstepf(gs, ls, D23, a).phead ≠ gstepf(gs, ls, D23, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs)) ∧ ( gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last ∨ gstepf(gs, ls, D23, a).qrl ≠ [] ∧ gstepf(gs, ls, D23, a).vtail = ( gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl.butlast ).last ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D23, a).vs [(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, D23, a).first ≠ lstepf(gs, ls, D23, a).lst ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).lst) ∧ lstepf(gs, ls, D23, a).lst ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).first ∧ ( gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ gstepf(gs, ls, D23, a).pretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ lstepf(gs, ls, D23, a).rvref ∈ gstepf(gs, ls, D23, a).vrvHp ∧ lstepf(gs, ls, D23, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D23, a).success ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ∈ gstepf(gs, ls, D23, a).vrvHp ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ≠ null ∧ gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid)) = Claimed (lstepf(gs, ls, D23, a).tid, lstepf(gs, ls, D23, a).optval.val) ∧ lstepf(gs, ls, D23, a).optval = Val(gstepf(gs, ls, D23, a).vs[lstepf(gs, ls, D23, a).nxt].val)) ∧ ( gstepf(gs, ls, D23, a).vhead ≠ lstepf(gs, ls, D23, a).first → nextnottid (lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs)) ∧ noid (lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, lstepf(gs, ls, D23, a).nxt, gstepf(gs, ls, D23, a).vs) ∧ noowns(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 403 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → ( gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D23, a).first ∈ gstepf(gs, ls, D23, a).orl ∧ lstepf(gs, ls, D23, a).nxt ≠ null ∧ lstepf(gs, ls, D23, a).nxt = gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).first].next ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).vrvHp[lstepf(gs, ls, D23, a).rvref] ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).prvHp[lstepf(gs, ls, D23, a).rvref]) ∧ ( listp (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ ¬ dups(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).ps) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vs) ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).ps) ∧ gstepf(gs, ls, D23, a).orl ≠ [] ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl ∧ rvownerok(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp) ∧ dom gstepf(gs, ls, D23, a).vrvHp = dom gstepf(gs, ls, D23, a).prvHp ∧ ( gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ≠ null ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs(gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid, gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D23, a).orl.last = gstepf(gs, ls, D23, a).vhead ∧ (gstepf(gs, ls, D23, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D23, a).qrl.tail, gstepf(gs, ls, D23, a).vs)) ∨ gstepf(gs, ls, D23, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D23, a).orl.butlast.last = gstepf(gs, ls, D23, a).vhead ∧ gstepf(gs, ls, D23, a).phead ≠ gstepf(gs, ls, D23, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs)) ∧ ( gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last ∨ gstepf(gs, ls, D23, a).qrl ≠ [] ∧ gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl.butlast).last ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D23, a).vs[(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D23, a).first ≠ lstepf(gs, ls, D23, a).lst ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).lst) ∧ lstepf(gs, ls, D23, a).lst ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).first ∧ ( gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ gstepf(gs, ls, D23, a).pretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ lstepf(gs, ls, D23, a).rvref ∈ gstepf(gs, ls, D23, a).vrvHp ∧ lstepf(gs, ls, D23, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D23, a).success ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ∈ gstepf(gs, ls, D23, a).vrvHp ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ≠ null ∧ gstepf(gs, ls, D23, a).rvowns(gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid)) = Claimed(lstepf(gs, ls, D23, a).tid, lstepf(gs, ls, D23, a).optval.val) ∧ lstepf(gs, ls, D23, a).optval = Val(gstepf(gs, ls, D23, a).vs[lstepf(gs, ls, D23, a).nxt].val)) ∧ ( gstepf(gs, ls, D23, a).vhead ≠ lstepf(gs, ls, D23, a).first → nextnottid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs)) ∧ noid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, lstepf(gs, ls, D23, a).nxt, gstepf(gs, ls, D23, a).vs) ∧ noowns(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).owns)

Lemma step-D23-D24

Proof step 404 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, DMSQGInv(gs), DMSQLInv(gs, ls, D23), pre(gs, ls, D23, a), ( (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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24 → ( gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D23, a).first ∈ gstepf(gs, ls, D23, a).orl ∧ lstepf(gs, ls, D23, a).nxt ≠ null ∧ lstepf(gs, ls, D23, a).nxt = gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).first].next ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).vrvHp[lstepf(gs, ls, D23, a).rvref] ∧ lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).prvHp[lstepf(gs, ls, D23, a).rvref]) ∧ ( listp (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ ¬ dups(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).ps) ∧ markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vs) ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).ps) ∧ gstepf(gs, ls, D23, a).orl ≠ [] ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl ∧ rvownerok(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp, gstepf(gs, ls, D23, a).rvowns) ∧ allocrv(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp) ∧ dom gstepf(gs, ls, D23, a).vrvHp = dom gstepf(gs, ls, D23, a).prvHp ∧ ( gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ≠ null ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs(gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid, gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D23, a).orl.last = gstepf(gs, ls, D23, a).vhead ∧ (gstepf(gs, ls, D23, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D23, a).qrl.tail, gstepf(gs, ls, D23, a).vs)) ∨ gstepf(gs, ls, D23, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D23, a).orl.butlast.last = gstepf(gs, ls, D23, a).vhead ∧ gstepf(gs, ls, D23, a).phead ≠ gstepf(gs, ls, D23, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs)) ∧ ( gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last ∨ gstepf(gs, ls, D23, a).qrl ≠ [] ∧ gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl.butlast).last ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D23, a).vs[(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, D23, a).first ≠ lstepf(gs, ls, D23, a).lst ∧ gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).lst) ∧ lstepf(gs, ls, D23, a).lst ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).first ∧ ( gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ gstepf(gs, ls, D23, a).pretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref ∧ lstepf(gs, ls, D23, a).rvref ∈ gstepf(gs, ls, D23, a).vrvHp ∧ lstepf(gs, ls, D23, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D23, a).success ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ∈ gstepf(gs, ls, D23, a).vrvHp ∧ gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ≠ null ∧ gstepf(gs, ls, D23, a).rvowns(gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid)) = Claimed(lstepf(gs, ls, D23, a).tid, lstepf(gs, ls, D23, a).optval.val) ∧ lstepf(gs, ls, D23, a).optval = Val(gstepf(gs, ls, D23, a).vs[lstepf(gs, ls, D23, a).nxt].val)) ∧ ( gstepf(gs, ls, D23, a).vhead ≠ lstepf(gs, ls, D23, a).first → nextnottid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs)) ∧ noid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, lstepf(gs, ls, D23, a).nxt, gstepf(gs, ls, D23, a).vs) ∧ noowns(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 405 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, DMSQGInv(gs), DMSQLInv(gs, ls, D23), pre(gs, ls, D23, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 406 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 407 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, gs.orl ≠ [], DMSQLInv(gs, ls, D23), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D23, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D23, a) ∧ pcstepf(gs, ls, D23, a) = D24, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D23], <all paths>

Additional information

Used simplifier rules: ⊦ D23 ≠ crashed; (s) ⊦ D23 ≠ idle; (s) ⊦ D23 ≠ ready; (s) ⊦ D23 ≠ E1; (s) ⊦ D23 ≠ E17; (s) ⊦ D1 ≠ D23; (s) ⊦ D2 ≠ D23; (s) ⊦ D7 ≠ D23; (s) ⊦ D23 ≠ D32; (s) ⊦ D23 ≠ D33; (s) ⊦ D23 ≠ E4; (s) ⊦ D23 ≠ E16; (s) ⊦ D23 ≠ E15; (s) ⊦ D23 ≠ E14; (s) ⊦ D23 ≠ E13; (s) ⊦ D23 ≠ E12; (s) ⊦ D23 ≠ E11; (s) ⊦ D23 ≠ E10; (s) ⊦ D23 ≠ E9; (s) ⊦ D23 ≠ E8; (s) ⊦ D23 ≠ E7; (s) ⊦ D23 ≠ E6; (s) ⊦ D23 ≠ E5; (s) ⊦ D23 ≠ E3; (s) ⊦ D23 ≠ E2; (s) ⊦ D23 ≠ D34; (s) ⊦ D23 ≠ D31; (s) ⊦ D23 ≠ D30; (s) ⊦ D23 ≠ D29; (s) ⊦ D23 ≠ D28; (s) ⊦ D23 ≠ D27; (s) ⊦ D23 ≠ D26; (s) ⊦ D23 ≠ D25; (s) ⊦ D23 ≠ D24; (s) ⊦ D22 ≠ D23; (s) ⊦ D21 ≠ D23; (s) ⊦ D20 ≠ D23; (s) ⊦ D19 ≠ D23; (s) ⊦ D18 ≠ D23; (s) ⊦ D17 ≠ D23; (s) ⊦ D16 ≠ D23; (s) ⊦ D15 ≠ D23; (s) ⊦ D14 ≠ D23; (s) ⊦ D13 ≠ D23; (s) ⊦ D12 ≠ D23; (s) ⊦ D11 ≠ D23; (s) ⊦ D10 ≠ D23; (s) ⊦ D9 ≠ D23; (s) ⊦ D8 ≠ D23; (s) ⊦ D6 ≠ D23; (s) ⊦ D5 ≠ D23; (s) ⊦ D4 ≠ D23; (s) ⊦ D3 ≠ D23; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D23, a) = D24; (s) Used terms: gs, ls, D23

Proof step 408 from proof copied-step-DMSQLInv (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 409 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D23, a).nxt = gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).first].next, lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).vrvHp[lstepf(gs, ls, D23, a).rvref], lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).prvHp[lstepf(gs, ls, D23, a).rvref], lstepf(gs, ls, D23, a).optval = Val(gstepf(gs, ls, D23, a).vs[lstepf(gs, ls, D23, a).nxt].val), gstepf(gs, ls, D23, a).pretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref, gstepf(gs, ls, D23, a).rvowns(gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid)) = Claimed(lstepf(gs, ls, D23, a).tid, lstepf(gs, ls, D23, a).optval.val), gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref, dom gstepf(gs, ls, D23, a).vrvHp = dom gstepf(gs, ls, D23, a).prvHp, gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).nxt].deqID ≠ None, lstepf(gs, ls, D23, a).first ≠ lstepf(gs, ls, D23, a).lst, lstepf(gs, ls, D23, a).nxt ≠ null, gstepf(gs, ls, D23, a).orl ≠ [], lstepf(gs, ls, D23, a).rvref ≠ null, gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ≠ null, lstepf(gs, ls, D23, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D23), allocrv(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp), allocrv(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp), listp(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns), markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).ps), markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vs), noid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, lstepf(gs, ls, D23, a).nxt, gstepf(gs, ls, D23, a).vs), nonullRetRefs (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).pretRefs), noowns(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).owns), pre(gs, ls, D23, a), rvownerok(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).rvowns), rvownerok(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp, gstepf(gs, ls, D23, a).rvowns), unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).ps), lstepf(gs, ls, D23, a).first ∈ gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).lst, lstepf(gs, ls, D23, a).lst ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).first, lstepf(gs, ls, D23, a).rvref ∈ gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ∈ gstepf(gs, ls, D23, a).vrvHp, ¬ dups(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl), gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ≠ null ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs(gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid, gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].val), gstepf(gs, ls, D23, a).vhead ≠ lstepf(gs, ls, D23, a).first → nextnottid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs), gstepf(gs, ls, D23, a).orl.last = gstepf(gs, ls, D23, a).vhead ∧ (gstepf(gs, ls, D23, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D23, a).qrl.tail, gstepf(gs, ls, D23, a).vs)) ∨ gstepf(gs, ls, D23, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D23, a).orl.butlast.last = gstepf(gs, ls, D23, a).vhead ∧ gstepf(gs, ls, D23, a).phead ≠ gstepf(gs, ls, D23, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs), gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last ∨ gstepf(gs, ls, D23, a).qrl ≠ [] ∧ gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl.butlast).last ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D23, a).vs[(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 410 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 411 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D23, a).nxt = gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).first].next, lstepf(gs, ls, D23, a).optval = Val(gstepf(gs, ls, D23, a).vs[lstepf(gs, ls, D23, a).nxt].val), lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).prvHp[lstepf(gs, ls, D23, a).rvref], lstepf(gs, ls, D23, a).optval = gstepf(gs, ls, D23, a).vrvHp[lstepf(gs, ls, D23, a).rvref], gstepf(gs, ls, D23, a).pretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref, gstepf(gs, ls, D23, a).rvowns(gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid)) = Claimed(lstepf(gs, ls, D23, a).tid, lstepf(gs, ls, D23, a).optval.val), gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) = lstepf(gs, ls, D23, a).rvref, dom gstepf(gs, ls, D23, a).vrvHp = dom gstepf(gs, ls, D23, a).prvHp, gs0 = gstepf(gs, ls, D23, a), ls0 = lstepf(gs, ls, D23, a), pc0 = D24, gstepf(gs, ls, D23, a).ps[lstepf(gs, ls, D23, a).nxt].deqID ≠ None, lstepf(gs, ls, D23, a).first ≠ lstepf(gs, ls, D23, a).lst, lstepf(gs, ls, D23, a).nxt ≠ null, gstepf(gs, ls, D23, a).orl ≠ [], lstepf(gs, ls, D23, a).rvref ≠ null, gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ≠ null, lstepf(gs, ls, D23, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, D23), allocrv(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp), allocrv(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp), listp(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns), markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).vs), markedp(gstepf(gs, ls, D23, a).orl, gstepf(gs, ls, D23, a).ps), noid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, lstepf(gs, ls, D23, a).nxt, gstepf(gs, ls, D23, a).vs), nonullRetRefs (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).pretRefs), noowns(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).owns), pre(gs, ls, D23, a), rvownerok(gstepf(gs, ls, D23, a).pretRefs, gstepf(gs, ls, D23, a).prvHp, gstepf(gs, ls, D23, a).rvowns), rvownerok(gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp, gstepf(gs, ls, D23, a).rvowns), unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).ps), gstepf(gs, ls, D23, a).vretRefs(lstepf(gs, ls, D23, a).tid) ∈ gstepf(gs, ls, D23, a).vrvHp, lstepf(gs, ls, D23, a).rvref ∈ gstepf(gs, ls, D23, a).vrvHp, lstepf(gs, ls, D23, a).lst ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).first, gstepf(gs, ls, D23, a).vtail ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from lstepf(gs, ls, D23, a).lst, gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl, lstepf(gs, ls, D23, a).first ∈ gstepf(gs, ls, D23, a).orl, ¬ dups(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl), gstepf(gs, ls, D23, a).vhead ≠ lstepf(gs, ls, D23, a).first → nextnottid(lstepf(gs, ls, D23, a).tid, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs), gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next ≠ null ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D23, a).rvowns (gstepf(gs, ls, D23, a).vretRefs(gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].deqID.tid, gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).vhead].next].val), gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last ∨ gstepf(gs, ls, D23, a).qrl ≠ [] ∧ gstepf(gs, ls, D23, a).vtail = (gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl.butlast).last ∧ gstepf(gs, ls, D23, a).vs[gstepf(gs, ls, D23, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D23, a).vs[(gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl).last].next = null, gstepf(gs, ls, D23, a).orl.last = gstepf(gs, ls, D23, a).vhead ∧ (gstepf(gs, ls, D23, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D23, a).qrl.tail, gstepf(gs, ls, D23, a).vs)) ∨ gstepf(gs, ls, D23, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D23, a).orl.butlast.last = gstepf(gs, ls, D23, a).vhead ∧ gstepf(gs, ls, D23, a).phead ≠ gstepf(gs, ls, D23, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D23, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D24 ≠ E1; (s) ⊦ D24 ≠ E12; (s) ⊦ D24 ≠ E17; (s) ⊦ D24 ≠ D25; (s) ⊦ D24 ≠ D26; (s) ⊦ D24 ≠ D27; (s) ⊦ D24 ≠ D28; (s) ⊦ D24 ≠ D29; (s) ⊦ D24 ≠ D30; (s) ⊦ D24 ≠ D31; (s) ⊦ D24 ≠ D32; (s) ⊦ D24 ≠ D33; (s) ⊦ D24 ≠ D34; (s) ⊦ D24 ≠ crashed; (s) ⊦ D24 ≠ idle; (s) ⊦ D24 ≠ ready; (s) ⊦ D1 ≠ D24; (s) ⊦ D2 ≠ D24; (s) ⊦ D3 ≠ D24; (s) ⊦ D4 ≠ D24; (s) ⊦ D5 ≠ D24; (s) ⊦ D6 ≠ D24; (s) ⊦ D7 ≠ D24; (s) ⊦ D8 ≠ D24; (s) ⊦ D9 ≠ D24; (s) ⊦ D10 ≠ D24; (s) ⊦ D11 ≠ D24; (s) ⊦ D12 ≠ D24; (s) ⊦ D13 ≠ D24; (s) ⊦ D14 ≠ D24; (s) ⊦ D15 ≠ D24; (s) ⊦ D16 ≠ D24; (s) ⊦ D17 ≠ D24; (s) ⊦ D18 ≠ D24; (s) ⊦ D19 ≠ D24; (s) ⊦ D20 ≠ D24; (s) ⊦ D21 ≠ D24; (s) ⊦ D22 ≠ D24; (s) ⊦ D23 ≠ D24; (s) ⊦ D24 ≠ E2; (s) ⊦ D24 ≠ E3; (s) ⊦ D24 ≠ E5; (s) ⊦ D24 ≠ E6; (s) ⊦ D24 ≠ E7; (s) ⊦ D24 ≠ E8; (s) ⊦ D24 ≠ E9; (s) ⊦ D24 ≠ E13; (s) ⊦ D24 ≠ E14; (s) ⊦ D24 ≠ E15; (s) ⊦ D24 ≠ E16; (s) ⊦ D24 ≠ E10; (s) ⊦ D24 ≠ E11; (s) ⊦ D24 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ Val(val).val = val; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, D23, τ) = gs.prvHp:= gs.prvHp[ls.rvref, gs.vrvHp[ls.rvref]]; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ lstepf(gs, ls, D23, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 412 from proof copied-step-DMSQLInv (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 413 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D24, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 414 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = pcstepf(gs, ls, D24, a), DMSQGInv(gs), DMSQLInv(gs, ls, D24), pre(gs, ls, D24, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D24, seq: ⊦ pcstepf(gs, ls, D24, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 415 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D24, a) = D6

A spec-lemma

Proof step 416 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D24), pre(gs, ls, D24, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D24-D6, seq:⊦ ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → ( ( lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = ( lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed (lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok (gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv (gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv (gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs [gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs (gstepf(gs, ls, D24, a).vs [gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D24, a).vs [gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D24, a).vs [gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ ( gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = ( gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast ).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D24, a).vs [(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid (lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 417 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → ( ( lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid (lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns)

Lemma step-D24-D6

Proof step 418 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D24), pre(gs, ls, D24, a), ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6 → ( ( lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref]) ∧ gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps) ∧ markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs) ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps) ∧ gstepf(gs, ls, D24, a).orl ≠ [] ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl ∧ rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns) ∧ allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp) ∧ dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp ∧ ( gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs)) ∧ ( gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref ∧ lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp ∧ lstepf(gs, ls, D24, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 419 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D24), pre(gs, ls, D24, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 420 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 421 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D24), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D24, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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]) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( 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)) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D24, a) ∧ pcstepf(gs, ls, D24, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D24], <all paths>

Additional information

Used simplifier rules: ⊦ D24 ≠ crashed; (s) ⊦ D24 ≠ idle; (s) ⊦ D24 ≠ ready; (s) ⊦ D24 ≠ E1; (s) ⊦ D24 ≠ E17; (s) ⊦ D1 ≠ D24; (s) ⊦ D2 ≠ D24; (s) ⊦ D7 ≠ D24; (s) ⊦ D24 ≠ D32; (s) ⊦ D24 ≠ D33; (s) ⊦ D24 ≠ E4; (s) ⊦ D24 ≠ E16; (s) ⊦ D24 ≠ E15; (s) ⊦ D24 ≠ E14; (s) ⊦ D24 ≠ E13; (s) ⊦ D24 ≠ E12; (s) ⊦ D24 ≠ E11; (s) ⊦ D24 ≠ E10; (s) ⊦ D24 ≠ E9; (s) ⊦ D24 ≠ E8; (s) ⊦ D24 ≠ E7; (s) ⊦ D24 ≠ E6; (s) ⊦ D24 ≠ E5; (s) ⊦ D24 ≠ E3; (s) ⊦ D24 ≠ E2; (s) ⊦ D24 ≠ D34; (s) ⊦ D24 ≠ D31; (s) ⊦ D24 ≠ D30; (s) ⊦ D24 ≠ D29; (s) ⊦ D24 ≠ D28; (s) ⊦ D24 ≠ D27; (s) ⊦ D24 ≠ D26; (s) ⊦ D24 ≠ D25; (s) ⊦ D23 ≠ D24; (s) ⊦ D22 ≠ D24; (s) ⊦ D21 ≠ D24; (s) ⊦ D20 ≠ D24; (s) ⊦ D19 ≠ D24; (s) ⊦ D18 ≠ D24; (s) ⊦ D17 ≠ D24; (s) ⊦ D16 ≠ D24; (s) ⊦ D15 ≠ D24; (s) ⊦ D14 ≠ D24; (s) ⊦ D13 ≠ D24; (s) ⊦ D12 ≠ D24; (s) ⊦ D11 ≠ D24; (s) ⊦ D10 ≠ D24; (s) ⊦ D9 ≠ D24; (s) ⊦ D8 ≠ D24; (s) ⊦ D6 ≠ D24; (s) ⊦ D5 ≠ D24; (s) ⊦ D4 ≠ D24; (s) ⊦ D3 ≠ D24; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D24, a) = D6; (s) Used terms: gs, ls, D24

Proof step 422 from proof copied-step-DMSQLInv (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 423 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref, gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) ), gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref, dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp, gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, gstepf(gs, ls, D24, a).orl ≠ [], lstepf(gs, ls, D24, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D24), allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp), allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp), listp(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns), markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps), markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs), nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs), noid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs), nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs), noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns), pre(gs, ls, D24, a), rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns), rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns), unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps), gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl, lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp, ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl), lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref], gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val), gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs), gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 424 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 425 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D24, a).pretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref, gstepf(gs, ls, D24, a).rvowns(gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid)) = (lstepf(gs, ls, D24, a).optval = Empty ∨ ¬ lstepf(gs, ls, D24, a).success ⊃ Pending(lstepf(gs, ls, D24, a).tid) ;Claimed(lstepf(gs, ls, D24, a).tid, lstepf(gs, ls, D24, a).optval.val) ), gstepf(gs, ls, D24, a).vretRefs(lstepf(gs, ls, D24, a).tid) = lstepf(gs, ls, D24, a).rvref, dom gstepf(gs, ls, D24, a).vrvHp = dom gstepf(gs, ls, D24, a).prvHp, gs0 = gstepf(gs, ls, D24, a), ls0 = lstepf(gs, ls, D24, a), pc0 = D6, gstepf(gs, ls, D24, a).orl ≠ [], lstepf(gs, ls, D24, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D24), allocrv(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp), allocrv(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp), listp(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns), markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).vs), markedp(gstepf(gs, ls, D24, a).orl, gstepf(gs, ls, D24, a).ps), nextnottid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs), noid(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs), nonullRetRefs (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).pretRefs), noowns(lstepf(gs, ls, D24, a).tid, gstepf(gs, ls, D24, a).owns), pre(gs, ls, D24, a), rvownerok(gstepf(gs, ls, D24, a).pretRefs, gstepf(gs, ls, D24, a).prvHp, gstepf(gs, ls, D24, a).rvowns), rvownerok(gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).rvowns), unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).ps), lstepf(gs, ls, D24, a).rvref ∈ gstepf(gs, ls, D24, a).vrvHp, gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl, ¬ dups(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl), gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next ≠ null ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D24, a).rvowns (gstepf(gs, ls, D24, a).vretRefs(gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].deqID.tid, gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).vhead].next].val), lstepf(gs, ls, D24, a).success → lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).vrvHp[lstepf(gs, ls, D24, a).rvref] ∧ lstepf(gs, ls, D24, a).optval = gstepf(gs, ls, D24, a).prvHp[lstepf(gs, ls, D24, a).rvref], gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last ∨ gstepf(gs, ls, D24, a).qrl ≠ [] ∧ gstepf(gs, ls, D24, a).vtail = (gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl.butlast).last ∧ gstepf(gs, ls, D24, a).vs[gstepf(gs, ls, D24, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D24, a).vs[(gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl).last].next = null, gstepf(gs, ls, D24, a).orl.last = gstepf(gs, ls, D24, a).vhead ∧ (gstepf(gs, ls, D24, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D24, a).qrl.tail, gstepf(gs, ls, D24, a).vs)) ∨ gstepf(gs, ls, D24, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D24, a).orl.butlast.last = gstepf(gs, ls, D24, a).vhead ∧ gstepf(gs, ls, D24, a).phead ≠ gstepf(gs, ls, D24, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D24, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ gstepf(gs, ls, D24, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) ⊦ lstepf(gs, ls, D24, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 426 from proof copied-step-DMSQLInv (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 427 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D25, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 428 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = pcstepf(gs, ls, D25, a), DMSQGInv(gs), DMSQLInv(gs, ls, D25), pre(gs, ls, D25, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D25, seq: ⊦ pcstepf(gs, ls, D25, a) = D26, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 429 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D25, a) = D26

A spec-lemma

Proof step 430 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, DMSQGInv(gs), DMSQLInv(gs, ls, D25), pre(gs, ls, D25, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D25-D26, seq:⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26 → ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs (lstepf(gs, ls, D25, a).othertid)) = Claimed (lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok (gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv (gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv (gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs [gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs (gstepf(gs, ls, D25, a).vs [gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D25, a).vs [gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D25, a).vs [gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ ( gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = ( gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast ).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D25, a).vs [(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid (lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 431 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26 → ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid (lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns)

Lemma step-D25-D26

Proof step 432 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, DMSQGInv(gs), DMSQLInv(gs, ls, D25), pre(gs, ls, D25, a), ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26 → ( lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl ∧ lstepf(gs, ls, D25, a).nxt ≠ null ∧ lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None ∧ gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid) ∧ lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val) ∧ ( gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns) ∧ ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps) ∧ markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs) ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps) ∧ gstepf(gs, ls, D25, a).orl ≠ [] ∧ gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl ∧ rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns) ∧ allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp) ∧ dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp ∧ ( gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs)) ∧ ( gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D25, a).success ∧ gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid)) ∧ ( lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst ∧ gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst) ∧ lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first ∧ ( gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref ∧ lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp ∧ lstepf(gs, ls, D25, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs) ∧ noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 433 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, DMSQGInv(gs), DMSQLInv(gs, ls, D25), pre(gs, ls, D25, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 434 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 435 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, gs.orl ≠ [], DMSQLInv(gs, ls, D25), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D25, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D25, a) ∧ pcstepf(gs, ls, D25, a) = D26, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D25], <all paths>

Additional information

Used simplifier rules: ⊦ D25 ≠ crashed; (s) ⊦ D25 ≠ idle; (s) ⊦ D25 ≠ ready; (s) ⊦ D25 ≠ E1; (s) ⊦ D25 ≠ E17; (s) ⊦ D1 ≠ D25; (s) ⊦ D2 ≠ D25; (s) ⊦ D7 ≠ D25; (s) ⊦ D25 ≠ E4; (s) ⊦ D25 ≠ E16; (s) ⊦ D25 ≠ E15; (s) ⊦ D25 ≠ E14; (s) ⊦ D25 ≠ E13; (s) ⊦ D25 ≠ E12; (s) ⊦ D25 ≠ E11; (s) ⊦ D25 ≠ E10; (s) ⊦ D25 ≠ E9; (s) ⊦ D25 ≠ E8; (s) ⊦ D25 ≠ E7; (s) ⊦ D25 ≠ E6; (s) ⊦ D25 ≠ E5; (s) ⊦ D25 ≠ E3; (s) ⊦ D25 ≠ E2; (s) ⊦ D25 ≠ D34; (s) ⊦ D25 ≠ D31; (s) ⊦ D25 ≠ D30; (s) ⊦ D25 ≠ D29; (s) ⊦ D25 ≠ D28; (s) ⊦ D25 ≠ D27; (s) ⊦ D25 ≠ D26; (s) ⊦ D24 ≠ D25; (s) ⊦ D23 ≠ D25; (s) ⊦ D22 ≠ D25; (s) ⊦ D21 ≠ D25; (s) ⊦ D20 ≠ D25; (s) ⊦ D19 ≠ D25; (s) ⊦ D18 ≠ D25; (s) ⊦ D17 ≠ D25; (s) ⊦ D16 ≠ D25; (s) ⊦ D15 ≠ D25; (s) ⊦ D14 ≠ D25; (s) ⊦ D13 ≠ D25; (s) ⊦ D12 ≠ D25; (s) ⊦ D11 ≠ D25; (s) ⊦ D10 ≠ D25; (s) ⊦ D9 ≠ D25; (s) ⊦ D8 ≠ D25; (s) ⊦ D6 ≠ D25; (s) ⊦ D5 ≠ D25; (s) ⊦ D4 ≠ D25; (s) ⊦ D3 ≠ D25; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D25, a) = D26; (s) Used terms: gs, ls, D25

Proof step 436 from proof copied-step-DMSQLInv (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 437 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid), lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next, lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val), gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref, gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid), gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref, dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp, gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None, lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst, lstepf(gs, ls, D25, a).nxt ≠ null, gstepf(gs, ls, D25, a).orl ≠ [], lstepf(gs, ls, D25, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D25), allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp), allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp), listp(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns), markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps), markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs), nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs), noid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs), nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs), noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns), pre(gs, ls, D25, a), rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns), rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns), unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps), lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst, lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first, lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp, ¬ lstepf(gs, ls, D25, a).success, ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl), gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val), gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val), gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs), gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 438 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 439 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID = Some(lstepf(gs, ls, D25, a).othertid), lstepf(gs, ls, D25, a).nxt = gstepf(gs, ls, D25, a).ps[lstepf(gs, ls, D25, a).first].next, lstepf(gs, ls, D25, a).optval = Val(gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].val), gstepf(gs, ls, D25, a).pretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref, gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid)) = Pending(lstepf(gs, ls, D25, a).tid), gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).tid) = lstepf(gs, ls, D25, a).rvref, dom gstepf(gs, ls, D25, a).vrvHp = dom gstepf(gs, ls, D25, a).prvHp, gs0 = gstepf(gs, ls, D25, a), ls0 = lstepf(gs, ls, D25, a), pc0 = D26, gstepf(gs, ls, D25, a).vs[lstepf(gs, ls, D25, a).nxt].deqID ≠ None, lstepf(gs, ls, D25, a).first ≠ lstepf(gs, ls, D25, a).lst, lstepf(gs, ls, D25, a).nxt ≠ null, gstepf(gs, ls, D25, a).orl ≠ [], lstepf(gs, ls, D25, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D25), allocrv(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp), allocrv(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp), listp(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).ps, gstepf(gs, ls, D25, a).owns), markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).vs), markedp(gstepf(gs, ls, D25, a).orl, gstepf(gs, ls, D25, a).ps), nextnottid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs), noid(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vhead, gstepf(gs, ls, D25, a).vs), nonullRetRefs (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs, gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).pretRefs), noowns(lstepf(gs, ls, D25, a).tid, gstepf(gs, ls, D25, a).owns), pre(gs, ls, D25, a), rvownerok(gstepf(gs, ls, D25, a).pretRefs, gstepf(gs, ls, D25, a).prvHp, gstepf(gs, ls, D25, a).rvowns), rvownerok(gstepf(gs, ls, D25, a).vretRefs, gstepf(gs, ls, D25, a).vrvHp, gstepf(gs, ls, D25, a).rvowns), unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).ps), lstepf(gs, ls, D25, a).rvref ∈ gstepf(gs, ls, D25, a).vrvHp, lstepf(gs, ls, D25, a).lst ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).first, gstepf(gs, ls, D25, a).vtail ∈ gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl from lstepf(gs, ls, D25, a).lst, gstepf(gs, ls, D25, a).phead ∈ gstepf(gs, ls, D25, a).orl, lstepf(gs, ls, D25, a).first ∈ gstepf(gs, ls, D25, a).orl, ¬ lstepf(gs, ls, D25, a).success, ¬ dups(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl), gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next ≠ null ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D25, a).rvowns (gstepf(gs, ls, D25, a).vretRefs(gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].deqID.tid, gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).vhead].next].val), gstepf(gs, ls, D25, a).vhead = lstepf(gs, ls, D25, a).first → gstepf(gs, ls, D25, a).rvowns(gstepf(gs, ls, D25, a).vretRefs(lstepf(gs, ls, D25, a).othertid)) = Claimed(lstepf(gs, ls, D25, a).othertid, lstepf(gs, ls, D25, a).optval.val), gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last ∨ gstepf(gs, ls, D25, a).qrl ≠ [] ∧ gstepf(gs, ls, D25, a).vtail = (gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl.butlast).last ∧ gstepf(gs, ls, D25, a).vs[gstepf(gs, ls, D25, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D25, a).vs[(gstepf(gs, ls, D25, a).orl + gstepf(gs, ls, D25, a).qrl).last].next = null, gstepf(gs, ls, D25, a).orl.last = gstepf(gs, ls, D25, a).vhead ∧ (gstepf(gs, ls, D25, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D25, a).qrl.tail, gstepf(gs, ls, D25, a).vs)) ∨ gstepf(gs, ls, D25, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D25, a).orl.butlast.last = gstepf(gs, ls, D25, a).vhead ∧ gstepf(gs, ls, D25, a).phead ≠ gstepf(gs, ls, D25, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D25, a).qrl, gstepf(gs, ls, D25, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D25, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D26 ≠ D31; (s) ⊦ D26 ≠ D34; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D26 ≠ D27; (s) ⊦ D26 ≠ D28; (s) ⊦ D26 ≠ D29; (s) ⊦ D26 ≠ D30; (s) ⊦ D26 ≠ E1; (s) ⊦ D26 ≠ E12; (s) ⊦ D26 ≠ E17; (s) ⊦ D26 ≠ crashed; (s) ⊦ D26 ≠ idle; (s) ⊦ D26 ≠ ready; (s) ⊦ D1 ≠ D26; (s) ⊦ D2 ≠ D26; (s) ⊦ D3 ≠ D26; (s) ⊦ D4 ≠ D26; (s) ⊦ D5 ≠ D26; (s) ⊦ D6 ≠ D26; (s) ⊦ D7 ≠ D26; (s) ⊦ D8 ≠ D26; (s) ⊦ D9 ≠ D26; (s) ⊦ D10 ≠ D26; (s) ⊦ D11 ≠ D26; (s) ⊦ D12 ≠ D26; (s) ⊦ D13 ≠ D26; (s) ⊦ D14 ≠ D26; (s) ⊦ D15 ≠ D26; (s) ⊦ D16 ≠ D26; (s) ⊦ D17 ≠ D26; (s) ⊦ D18 ≠ D26; (s) ⊦ D19 ≠ D26; (s) ⊦ D20 ≠ D26; (s) ⊦ D21 ≠ D26; (s) ⊦ D22 ≠ D26; (s) ⊦ D23 ≠ D26; (s) ⊦ D24 ≠ D26; (s) ⊦ D25 ≠ D26; (s) ⊦ D26 ≠ E2; (s) ⊦ D26 ≠ E3; (s) ⊦ D26 ≠ E5; (s) ⊦ D26 ≠ E6; (s) ⊦ D26 ≠ E7; (s) ⊦ D26 ≠ E8; (s) ⊦ D26 ≠ E9; (s) ⊦ D26 ≠ E13; (s) ⊦ D26 ≠ E14; (s) ⊦ D26 ≠ E15; (s) ⊦ D26 ≠ E16; (s) ⊦ D26 ≠ E10; (s) ⊦ D26 ≠ E11; (s) ⊦ D26 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.othertid:= tid0).othertid = tid0; (s) ⊦ (ls.othertid:= tid0).first = ls.first; (s) ⊦ (ls.othertid:= tid0).optval = ls.optval; (s) ⊦ (ls.othertid:= tid0).nxt = ls.nxt; (s) ⊦ (ls.othertid:= tid0).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D25, τ) = gs; (s) ⊦ lstepf(gs, ls, D25, τ) = ls.othertid:= (gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid; (s) ⊦ (ls.othertid:= tid0).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 440 from proof copied-step-DMSQLInv (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 441 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D26, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 442 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = pcstepf(gs, ls, D26, a), DMSQGInv(gs), DMSQLInv(gs, ls, D26), pre(gs, ls, D26, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D26, seq: ⊦ pcstepf(gs, ls, D26, a) = D27, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 443 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D26, a) = D27

A spec-lemma

Proof step 444 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, DMSQGInv(gs), DMSQLInv(gs, ls, D26), pre(gs, ls, D26, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D26-D27, seq:⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D26, a) ∧ pcstepf(gs, ls, D26, a) = D27 → ( lstepf(gs, ls, D26, a).first ∈ gstepf(gs, ls, D26, a).orl ∧ lstepf(gs, ls, D26, a).nxt ≠ null ∧ lstepf(gs, ls, D26, a).nxt = gstepf(gs, ls, D26, a).ps[lstepf(gs, ls, D26, a).first].next ∧ gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].deqID = Some(lstepf(gs, ls, D26, a).othertid) ∧ ( gstepf(gs, ls, D26, a).vhead = lstepf(gs, ls, D26, a).first → gstepf(gs, ls, D26, a).rvowns(lstepf(gs, ls, D26, a).addr) = Claimed (lstepf(gs, ls, D26, a).othertid, lstepf(gs, ls, D26, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).ps, gstepf(gs, ls, D26, a).owns) ∧ ¬ dups(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).ps) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vs) ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).ps) ∧ gstepf(gs, ls, D26, a).orl ≠ [] ∧ gstepf(gs, ls, D26, a).phead ∈ gstepf(gs, ls, D26, a).orl ∧ rvownerok (gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv (gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv (gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp) ∧ dom gstepf(gs, ls, D26, a).vrvHp = dom gstepf(gs, ls, D26, a).prvHp ∧ ( gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ≠ null ∧ gstepf(gs, ls, D26, a).vs [gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs (gstepf(gs, ls, D26, a).vs [gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D26, a).vs [gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D26, a).vs [gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D26, a).orl.last = gstepf(gs, ls, D26, a).vhead ∧ ( gstepf(gs, ls, D26, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D26, a).qrl.tail, gstepf(gs, ls, D26, a).vs)) ∨ gstepf(gs, ls, D26, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D26, a).orl.butlast.last = gstepf(gs, ls, D26, a).vhead ∧ gstepf(gs, ls, D26, a).phead ≠ gstepf(gs, ls, D26, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs)) ∧ ( gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last ∨ gstepf(gs, ls, D26, a).qrl ≠ [] ∧ gstepf(gs, ls, D26, a).vtail = ( gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl.butlast ).last ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D26, a).vs [(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D26, a).success ∧ gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid)) = Pending(lstepf(gs, ls, D26, a).tid)) ∧ ( lstepf(gs, ls, D26, a).first ≠ lstepf(gs, ls, D26, a).lst ∧ gstepf(gs, ls, D26, a).vtail ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).lst) ∧ lstepf(gs, ls, D26, a).lst ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).first ∧ ( gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ gstepf(gs, ls, D26, a).pretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ lstepf(gs, ls, D26, a).rvref ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D26, a).addr ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).addr ≠ null ∧ lstepf(gs, ls, D26, a).optval = Val(gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].val)) ∧ nextnottid (lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noid (lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noowns(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 445 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D26, a) ∧ pcstepf(gs, ls, D26, a) = D27 → ( lstepf(gs, ls, D26, a).first ∈ gstepf(gs, ls, D26, a).orl ∧ lstepf(gs, ls, D26, a).nxt ≠ null ∧ lstepf(gs, ls, D26, a).nxt = gstepf(gs, ls, D26, a).ps[lstepf(gs, ls, D26, a).first].next ∧ gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].deqID = Some(lstepf(gs, ls, D26, a).othertid) ∧ ( gstepf(gs, ls, D26, a).vhead = lstepf(gs, ls, D26, a).first → gstepf(gs, ls, D26, a).rvowns(lstepf(gs, ls, D26, a).addr) = Claimed(lstepf(gs, ls, D26, a).othertid, lstepf(gs, ls, D26, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).ps, gstepf(gs, ls, D26, a).owns) ∧ ¬ dups(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).ps) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vs) ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).ps) ∧ gstepf(gs, ls, D26, a).orl ≠ [] ∧ gstepf(gs, ls, D26, a).phead ∈ gstepf(gs, ls, D26, a).orl ∧ rvownerok(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp) ∧ dom gstepf(gs, ls, D26, a).vrvHp = dom gstepf(gs, ls, D26, a).prvHp ∧ ( gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ≠ null ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs(gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid, gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D26, a).orl.last = gstepf(gs, ls, D26, a).vhead ∧ (gstepf(gs, ls, D26, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D26, a).qrl.tail, gstepf(gs, ls, D26, a).vs)) ∨ gstepf(gs, ls, D26, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D26, a).orl.butlast.last = gstepf(gs, ls, D26, a).vhead ∧ gstepf(gs, ls, D26, a).phead ≠ gstepf(gs, ls, D26, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs)) ∧ ( gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last ∨ gstepf(gs, ls, D26, a).qrl ≠ [] ∧ gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl.butlast).last ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D26, a).vs[(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D26, a).success ∧ gstepf(gs, ls, D26, a).rvowns(gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid)) = Pending(lstepf(gs, ls, D26, a).tid)) ∧ ( lstepf(gs, ls, D26, a).first ≠ lstepf(gs, ls, D26, a).lst ∧ gstepf(gs, ls, D26, a).vtail ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).lst) ∧ lstepf(gs, ls, D26, a).lst ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).first ∧ ( gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ gstepf(gs, ls, D26, a).pretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ lstepf(gs, ls, D26, a).rvref ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D26, a).addr ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).addr ≠ null ∧ lstepf(gs, ls, D26, a).optval = Val(gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noid (lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noowns(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).owns)

Lemma step-D26-D27

Proof step 446 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, DMSQGInv(gs), DMSQLInv(gs, ls, D26), pre(gs, ls, D26, a), ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D26, a) ∧ pcstepf(gs, ls, D26, a) = D27 → ( lstepf(gs, ls, D26, a).first ∈ gstepf(gs, ls, D26, a).orl ∧ lstepf(gs, ls, D26, a).nxt ≠ null ∧ lstepf(gs, ls, D26, a).nxt = gstepf(gs, ls, D26, a).ps[lstepf(gs, ls, D26, a).first].next ∧ gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].deqID = Some(lstepf(gs, ls, D26, a).othertid) ∧ ( gstepf(gs, ls, D26, a).vhead = lstepf(gs, ls, D26, a).first → gstepf(gs, ls, D26, a).rvowns(lstepf(gs, ls, D26, a).addr) = Claimed(lstepf(gs, ls, D26, a).othertid, lstepf(gs, ls, D26, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).ps, gstepf(gs, ls, D26, a).owns) ∧ ¬ dups(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).ps) ∧ markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vs) ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).ps) ∧ gstepf(gs, ls, D26, a).orl ≠ [] ∧ gstepf(gs, ls, D26, a).phead ∈ gstepf(gs, ls, D26, a).orl ∧ rvownerok(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp, gstepf(gs, ls, D26, a).rvowns) ∧ allocrv(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp) ∧ dom gstepf(gs, ls, D26, a).vrvHp = dom gstepf(gs, ls, D26, a).prvHp ∧ ( gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ≠ null ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs(gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid, gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D26, a).orl.last = gstepf(gs, ls, D26, a).vhead ∧ (gstepf(gs, ls, D26, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D26, a).qrl.tail, gstepf(gs, ls, D26, a).vs)) ∨ gstepf(gs, ls, D26, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D26, a).orl.butlast.last = gstepf(gs, ls, D26, a).vhead ∧ gstepf(gs, ls, D26, a).phead ≠ gstepf(gs, ls, D26, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs)) ∧ ( gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last ∨ gstepf(gs, ls, D26, a).qrl ≠ [] ∧ gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl.butlast).last ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D26, a).vs[(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D26, a).success ∧ gstepf(gs, ls, D26, a).rvowns(gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid)) = Pending(lstepf(gs, ls, D26, a).tid)) ∧ ( lstepf(gs, ls, D26, a).first ≠ lstepf(gs, ls, D26, a).lst ∧ gstepf(gs, ls, D26, a).vtail ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).lst) ∧ lstepf(gs, ls, D26, a).lst ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).first ∧ ( gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ gstepf(gs, ls, D26, a).pretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref ∧ lstepf(gs, ls, D26, a).rvref ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D26, a).addr ∈ gstepf(gs, ls, D26, a).vrvHp ∧ lstepf(gs, ls, D26, a).addr ≠ null ∧ lstepf(gs, ls, D26, a).optval = Val(gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs) ∧ noowns(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 447 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, DMSQGInv(gs), DMSQLInv(gs, ls, D26), pre(gs, ls, D26, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D26, a) ∧ pcstepf(gs, ls, D26, a) = D27

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 448 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 449 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, gs.orl ≠ [], DMSQLInv(gs, ls, D26), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D26, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D26, a) ∧ pcstepf(gs, ls, D26, a) = D27, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D26], <all paths>

Additional information

Used simplifier rules: ⊦ D26 ≠ crashed; (s) ⊦ D26 ≠ idle; (s) ⊦ D26 ≠ ready; (s) ⊦ D26 ≠ E1; (s) ⊦ D26 ≠ E17; (s) ⊦ D1 ≠ D26; (s) ⊦ D2 ≠ D26; (s) ⊦ D7 ≠ D26; (s) ⊦ D26 ≠ E4; (s) ⊦ D26 ≠ E16; (s) ⊦ D26 ≠ E15; (s) ⊦ D26 ≠ E14; (s) ⊦ D26 ≠ E13; (s) ⊦ D26 ≠ E12; (s) ⊦ D26 ≠ E11; (s) ⊦ D26 ≠ E10; (s) ⊦ D26 ≠ E9; (s) ⊦ D26 ≠ E8; (s) ⊦ D26 ≠ E7; (s) ⊦ D26 ≠ E6; (s) ⊦ D26 ≠ E5; (s) ⊦ D26 ≠ E3; (s) ⊦ D26 ≠ E2; (s) ⊦ D26 ≠ D34; (s) ⊦ D26 ≠ D31; (s) ⊦ D26 ≠ D30; (s) ⊦ D26 ≠ D29; (s) ⊦ D26 ≠ D28; (s) ⊦ D26 ≠ D27; (s) ⊦ D25 ≠ D26; (s) ⊦ D24 ≠ D26; (s) ⊦ D23 ≠ D26; (s) ⊦ D22 ≠ D26; (s) ⊦ D21 ≠ D26; (s) ⊦ D20 ≠ D26; (s) ⊦ D19 ≠ D26; (s) ⊦ D18 ≠ D26; (s) ⊦ D17 ≠ D26; (s) ⊦ D16 ≠ D26; (s) ⊦ D15 ≠ D26; (s) ⊦ D14 ≠ D26; (s) ⊦ D13 ≠ D26; (s) ⊦ D12 ≠ D26; (s) ⊦ D11 ≠ D26; (s) ⊦ D10 ≠ D26; (s) ⊦ D9 ≠ D26; (s) ⊦ D8 ≠ D26; (s) ⊦ D6 ≠ D26; (s) ⊦ D5 ≠ D26; (s) ⊦ D4 ≠ D26; (s) ⊦ D3 ≠ D26; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D26, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D26, a) = D27; (s) Used terms: gs, ls, D26

Proof step 450 from proof copied-step-DMSQLInv (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 451 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].deqID = Some(lstepf(gs, ls, D26, a).othertid), lstepf(gs, ls, D26, a).nxt = gstepf(gs, ls, D26, a).ps[lstepf(gs, ls, D26, a).first].next, lstepf(gs, ls, D26, a).optval = Val(gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].val), gstepf(gs, ls, D26, a).pretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref, gstepf(gs, ls, D26, a).rvowns(gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid)) = Pending(lstepf(gs, ls, D26, a).tid), gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref, dom gstepf(gs, ls, D26, a).vrvHp = dom gstepf(gs, ls, D26, a).prvHp, gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, lstepf(gs, ls, D26, a).addr ≠ null, lstepf(gs, ls, D26, a).first ≠ lstepf(gs, ls, D26, a).lst, lstepf(gs, ls, D26, a).nxt ≠ null, gstepf(gs, ls, D26, a).orl ≠ [], lstepf(gs, ls, D26, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D26), allocrv(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp), allocrv(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp), listp(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).ps, gstepf(gs, ls, D26, a).owns), markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).ps), markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vs), nextnottid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs), noid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs), nonullRetRefs (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).pretRefs), noowns(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).owns), pre(gs, ls, D26, a), rvownerok(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp, gstepf(gs, ls, D26, a).rvowns), rvownerok(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp, gstepf(gs, ls, D26, a).rvowns), unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).ps), lstepf(gs, ls, D26, a).first ∈ gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).phead ∈ gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vtail ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).lst, lstepf(gs, ls, D26, a).lst ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).first, lstepf(gs, ls, D26, a).rvref ∈ gstepf(gs, ls, D26, a).vrvHp, lstepf(gs, ls, D26, a).addr ∈ gstepf(gs, ls, D26, a).vrvHp, ¬ lstepf(gs, ls, D26, a).success, ¬ dups(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl), gstepf(gs, ls, D26, a).vhead = lstepf(gs, ls, D26, a).first → gstepf(gs, ls, D26, a).rvowns(lstepf(gs, ls, D26, a).addr) = Claimed(lstepf(gs, ls, D26, a).othertid, lstepf(gs, ls, D26, a).optval.val), gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ≠ null ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs(gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid, gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].val), gstepf(gs, ls, D26, a).orl.last = gstepf(gs, ls, D26, a).vhead ∧ (gstepf(gs, ls, D26, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D26, a).qrl.tail, gstepf(gs, ls, D26, a).vs)) ∨ gstepf(gs, ls, D26, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D26, a).orl.butlast.last = gstepf(gs, ls, D26, a).vhead ∧ gstepf(gs, ls, D26, a).phead ≠ gstepf(gs, ls, D26, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs), gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last ∨ gstepf(gs, ls, D26, a).qrl ≠ [] ∧ gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl.butlast).last ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D26, a).vs[(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 452 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 453 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].deqID = Some(lstepf(gs, ls, D26, a).othertid), lstepf(gs, ls, D26, a).nxt = gstepf(gs, ls, D26, a).ps[lstepf(gs, ls, D26, a).first].next, lstepf(gs, ls, D26, a).optval = Val(gstepf(gs, ls, D26, a).vs[lstepf(gs, ls, D26, a).nxt].val), gstepf(gs, ls, D26, a).pretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref, gstepf(gs, ls, D26, a).rvowns(gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid)) = Pending(lstepf(gs, ls, D26, a).tid), gstepf(gs, ls, D26, a).vretRefs(lstepf(gs, ls, D26, a).tid) = lstepf(gs, ls, D26, a).rvref, dom gstepf(gs, ls, D26, a).vrvHp = dom gstepf(gs, ls, D26, a).prvHp, gs0 = gstepf(gs, ls, D26, a), ls0 = lstepf(gs, ls, D26, a), pc0 = D27, lstepf(gs, ls, D26, a).addr ≠ null, lstepf(gs, ls, D26, a).first ≠ lstepf(gs, ls, D26, a).lst, lstepf(gs, ls, D26, a).nxt ≠ null, gstepf(gs, ls, D26, a).orl ≠ [], lstepf(gs, ls, D26, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D26), allocrv(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp), allocrv(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp), listp(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).ps, gstepf(gs, ls, D26, a).owns), markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).vs), markedp(gstepf(gs, ls, D26, a).orl, gstepf(gs, ls, D26, a).ps), nextnottid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs), noid(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vhead, gstepf(gs, ls, D26, a).vs), nonullRetRefs (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs, gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).pretRefs), noowns(lstepf(gs, ls, D26, a).tid, gstepf(gs, ls, D26, a).owns), pre(gs, ls, D26, a), rvownerok(gstepf(gs, ls, D26, a).pretRefs, gstepf(gs, ls, D26, a).prvHp, gstepf(gs, ls, D26, a).rvowns), rvownerok(gstepf(gs, ls, D26, a).vretRefs, gstepf(gs, ls, D26, a).vrvHp, gstepf(gs, ls, D26, a).rvowns), unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).ps), lstepf(gs, ls, D26, a).addr ∈ gstepf(gs, ls, D26, a).vrvHp, lstepf(gs, ls, D26, a).rvref ∈ gstepf(gs, ls, D26, a).vrvHp, lstepf(gs, ls, D26, a).lst ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).first, gstepf(gs, ls, D26, a).vtail ∈ gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl from lstepf(gs, ls, D26, a).lst, gstepf(gs, ls, D26, a).phead ∈ gstepf(gs, ls, D26, a).orl, lstepf(gs, ls, D26, a).first ∈ gstepf(gs, ls, D26, a).orl, ¬ lstepf(gs, ls, D26, a).success, ¬ dups(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl), gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next ≠ null ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D26, a).rvowns (gstepf(gs, ls, D26, a).vretRefs(gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].deqID.tid, gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).vhead].next].val), gstepf(gs, ls, D26, a).vhead = lstepf(gs, ls, D26, a).first → gstepf(gs, ls, D26, a).rvowns(lstepf(gs, ls, D26, a).addr) = Claimed(lstepf(gs, ls, D26, a).othertid, lstepf(gs, ls, D26, a).optval.val), gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last ∨ gstepf(gs, ls, D26, a).qrl ≠ [] ∧ gstepf(gs, ls, D26, a).vtail = (gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl.butlast).last ∧ gstepf(gs, ls, D26, a).vs[gstepf(gs, ls, D26, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D26, a).vs[(gstepf(gs, ls, D26, a).orl + gstepf(gs, ls, D26, a).qrl).last].next = null, gstepf(gs, ls, D26, a).orl.last = gstepf(gs, ls, D26, a).vhead ∧ (gstepf(gs, ls, D26, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D26, a).qrl.tail, gstepf(gs, ls, D26, a).vs)) ∨ gstepf(gs, ls, D26, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D26, a).orl.butlast.last = gstepf(gs, ls, D26, a).vhead ∧ gstepf(gs, ls, D26, a).phead ≠ gstepf(gs, ls, D26, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D26, a).qrl, gstepf(gs, ls, D26, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D26, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D27 ≠ D28; (s) ⊦ D27 ≠ D29; (s) ⊦ D27 ≠ D30; (s) ⊦ D27 ≠ D31; (s) ⊦ D27 ≠ D34; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D27 ≠ E1; (s) ⊦ D27 ≠ E12; (s) ⊦ D27 ≠ E17; (s) ⊦ D27 ≠ crashed; (s) ⊦ D27 ≠ idle; (s) ⊦ D27 ≠ ready; (s) ⊦ D1 ≠ D27; (s) ⊦ D2 ≠ D27; (s) ⊦ D3 ≠ D27; (s) ⊦ D4 ≠ D27; (s) ⊦ D5 ≠ D27; (s) ⊦ D6 ≠ D27; (s) ⊦ D7 ≠ D27; (s) ⊦ D8 ≠ D27; (s) ⊦ D9 ≠ D27; (s) ⊦ D10 ≠ D27; (s) ⊦ D11 ≠ D27; (s) ⊦ D12 ≠ D27; (s) ⊦ D13 ≠ D27; (s) ⊦ D14 ≠ D27; (s) ⊦ D15 ≠ D27; (s) ⊦ D16 ≠ D27; (s) ⊦ D17 ≠ D27; (s) ⊦ D18 ≠ D27; (s) ⊦ D19 ≠ D27; (s) ⊦ D20 ≠ D27; (s) ⊦ D21 ≠ D27; (s) ⊦ D22 ≠ D27; (s) ⊦ D23 ≠ D27; (s) ⊦ D24 ≠ D27; (s) ⊦ D25 ≠ D27; (s) ⊦ D26 ≠ D27; (s) ⊦ D27 ≠ E2; (s) ⊦ D27 ≠ E3; (s) ⊦ D27 ≠ E5; (s) ⊦ D27 ≠ E6; (s) ⊦ D27 ≠ E7; (s) ⊦ D27 ≠ E8; (s) ⊦ D27 ≠ E9; (s) ⊦ D27 ≠ E13; (s) ⊦ D27 ≠ E14; (s) ⊦ D27 ≠ E15; (s) ⊦ D27 ≠ E16; (s) ⊦ D27 ≠ E10; (s) ⊦ D27 ≠ E11; (s) ⊦ D27 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.addr:= rvref0).othertid = ls.othertid; (s) ⊦ (ls.addr:= rvref0).first = ls.first; (s) ⊦ (ls.addr:= rvref0).optval = ls.optval; (s) ⊦ (ls.addr:= rvref0).nxt = ls.nxt; (s) ⊦ (ls.addr:= rvref0).rvref = ls.rvref; (s) ⊦ gstepf(gs, ls, D26, τ) = gs; (s) ⊦ lstepf(gs, ls, D26, τ) = ls.addr:= gs.vretRefs(ls.othertid); (s) ⊦ (ls.addr:= rvref0).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 454 from proof copied-step-DMSQLInv (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 455 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D27, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 456 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = pcstepf(gs, ls, D27, a), DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D27, seq: ⊦ pcstepf(gs, ls, D27, a) = (gs.vhead = ls.first ⊃ D28;D32), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 457 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D27, a) = (gs.vhead = ls.first ⊃ D28;D32)

A spec-lemma

Proof step 458 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = (gs.vhead = ls.first ⊃ D28;D32), DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 459 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs.vhead = ls.first, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D27-D28, seq:⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D28 → ( lstepf(gs, ls, D27, a).first ∈ gstepf(gs, ls, D27, a).orl ∧ lstepf(gs, ls, D27, a).nxt ≠ null ∧ lstepf(gs, ls, D27, a).nxt = gstepf(gs, ls, D27, a).ps[lstepf(gs, ls, D27, a).first].next ∧ gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].deqID = Some(lstepf(gs, ls, D27, a).othertid) ∧ gstepf(gs, ls, D27, a).rvowns(lstepf(gs, ls, D27, a).addr) = Claimed (lstepf(gs, ls, D27, a).othertid, lstepf(gs, ls, D27, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok (gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv (gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv (gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs (gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ ( gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = ( gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast ).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D27, a).vs [(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( lstepf(gs, ls, D27, a).first ≠ lstepf(gs, ls, D27, a).lst ∧ gstepf(gs, ls, D27, a).vtail ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).lst) ∧ lstepf(gs, ls, D27, a).lst ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).first ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D27, a).addr ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).addr ≠ null ∧ lstepf(gs, ls, D27, a).optval = Val(gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].val)) ∧ nextnottid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 460 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D28 → ( lstepf(gs, ls, D27, a).first ∈ gstepf(gs, ls, D27, a).orl ∧ lstepf(gs, ls, D27, a).nxt ≠ null ∧ lstepf(gs, ls, D27, a).nxt = gstepf(gs, ls, D27, a).ps[lstepf(gs, ls, D27, a).first].next ∧ gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].deqID = Some(lstepf(gs, ls, D27, a).othertid) ∧ gstepf(gs, ls, D27, a).rvowns(lstepf(gs, ls, D27, a).addr) = Claimed(lstepf(gs, ls, D27, a).othertid, lstepf(gs, ls, D27, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( lstepf(gs, ls, D27, a).first ≠ lstepf(gs, ls, D27, a).lst ∧ gstepf(gs, ls, D27, a).vtail ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).lst) ∧ lstepf(gs, ls, D27, a).lst ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).first ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D27, a).addr ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).addr ≠ null ∧ lstepf(gs, ls, D27, a).optval = Val(gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns)

Lemma step-D27-D28

Proof step 461 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs.vhead = ls.first, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a), ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D28 → ( lstepf(gs, ls, D27, a).first ∈ gstepf(gs, ls, D27, a).orl ∧ lstepf(gs, ls, D27, a).nxt ≠ null ∧ lstepf(gs, ls, D27, a).nxt = gstepf(gs, ls, D27, a).ps[lstepf(gs, ls, D27, a).first].next ∧ gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].deqID = Some(lstepf(gs, ls, D27, a).othertid) ∧ gstepf(gs, ls, D27, a).rvowns(lstepf(gs, ls, D27, a).addr) = Claimed(lstepf(gs, ls, D27, a).othertid, lstepf(gs, ls, D27, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( lstepf(gs, ls, D27, a).first ≠ lstepf(gs, ls, D27, a).lst ∧ gstepf(gs, ls, D27, a).vtail ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).lst) ∧ lstepf(gs, ls, D27, a).lst ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).first ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D27, a).addr ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).addr ≠ null ∧ lstepf(gs, ls, D27, a).optval = Val(gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 462 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs.vhead = ls.first, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D28

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 463 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 464 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs.vhead = ls.first, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, gs.orl ≠ [], DMSQLInv(gs, ls, D27), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D27, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D28, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D27], <all paths>

Additional information

Used simplifier rules: ⊦ D27 ≠ crashed; (s) ⊦ D27 ≠ idle; (s) ⊦ D27 ≠ ready; (s) ⊦ D27 ≠ E1; (s) ⊦ D27 ≠ E17; (s) ⊦ D1 ≠ D27; (s) ⊦ D2 ≠ D27; (s) ⊦ D7 ≠ D27; (s) ⊦ D27 ≠ E4; (s) ⊦ D27 ≠ E16; (s) ⊦ D27 ≠ E15; (s) ⊦ D27 ≠ E14; (s) ⊦ D27 ≠ E13; (s) ⊦ D27 ≠ E12; (s) ⊦ D27 ≠ E11; (s) ⊦ D27 ≠ E10; (s) ⊦ D27 ≠ E9; (s) ⊦ D27 ≠ E8; (s) ⊦ D27 ≠ E7; (s) ⊦ D27 ≠ E6; (s) ⊦ D27 ≠ E5; (s) ⊦ D27 ≠ E3; (s) ⊦ D27 ≠ E2; (s) ⊦ D27 ≠ D34; (s) ⊦ D27 ≠ D31; (s) ⊦ D27 ≠ D30; (s) ⊦ D27 ≠ D29; (s) ⊦ D27 ≠ D28; (s) ⊦ D26 ≠ D27; (s) ⊦ D25 ≠ D27; (s) ⊦ D24 ≠ D27; (s) ⊦ D23 ≠ D27; (s) ⊦ D22 ≠ D27; (s) ⊦ D21 ≠ D27; (s) ⊦ D20 ≠ D27; (s) ⊦ D19 ≠ D27; (s) ⊦ D18 ≠ D27; (s) ⊦ D17 ≠ D27; (s) ⊦ D16 ≠ D27; (s) ⊦ D15 ≠ D27; (s) ⊦ D14 ≠ D27; (s) ⊦ D13 ≠ D27; (s) ⊦ D12 ≠ D27; (s) ⊦ D11 ≠ D27; (s) ⊦ D10 ≠ D27; (s) ⊦ D9 ≠ D27; (s) ⊦ D8 ≠ D27; (s) ⊦ D6 ≠ D27; (s) ⊦ D5 ≠ D27; (s) ⊦ D4 ≠ D27; (s) ⊦ D3 ≠ D27; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D27, a) = (gs.vhead = ls.first ⊃ D28;D32); (s) Used terms: gs, ls, D27

Proof step 465 from proof copied-step-DMSQLInv (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 466 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].deqID = Some(lstepf(gs, ls, D27, a).othertid), lstepf(gs, ls, D27, a).nxt = gstepf(gs, ls, D27, a).ps[lstepf(gs, ls, D27, a).first].next, lstepf(gs, ls, D27, a).optval = Val(gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].val), gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, gstepf(gs, ls, D27, a).rvowns(lstepf(gs, ls, D27, a).addr) = Claimed(lstepf(gs, ls, D27, a).othertid, lstepf(gs, ls, D27, a).optval.val), gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid), gs.vhead = ls.first, gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, lstepf(gs, ls, D27, a).addr ≠ null, lstepf(gs, ls, D27, a).first ≠ lstepf(gs, ls, D27, a).lst, lstepf(gs, ls, D27, a).nxt ≠ null, gstepf(gs, ls, D27, a).orl ≠ [], lstepf(gs, ls, D27, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D27), allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp), allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp), listp(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs), nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs), noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), pre(gs, ls, D27, a), rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns), rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns), unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps), lstepf(gs, ls, D27, a).first ∈ gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vtail ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).lst, lstepf(gs, ls, D27, a).lst ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).first, lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp, lstepf(gs, ls, D27, a).addr ∈ gstepf(gs, ls, D27, a).vrvHp, ¬ lstepf(gs, ls, D27, a).success, ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl), gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val), gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs), gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 467 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 468 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].deqID = Some(lstepf(gs, ls, D27, a).othertid), lstepf(gs, ls, D27, a).nxt = gstepf(gs, ls, D27, a).ps[lstepf(gs, ls, D27, a).first].next, lstepf(gs, ls, D27, a).optval = Val(gstepf(gs, ls, D27, a).vs[lstepf(gs, ls, D27, a).nxt].val), gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid), gstepf(gs, ls, D27, a).rvowns(lstepf(gs, ls, D27, a).addr) = Claimed(lstepf(gs, ls, D27, a).othertid, lstepf(gs, ls, D27, a).optval.val), gs.vhead = ls.first, gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D28, lstepf(gs, ls, D27, a).addr ≠ null, lstepf(gs, ls, D27, a).first ≠ lstepf(gs, ls, D27, a).lst, lstepf(gs, ls, D27, a).nxt ≠ null, gstepf(gs, ls, D27, a).orl ≠ [], lstepf(gs, ls, D27, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D27), allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp), allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp), listp(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps), nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs), noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), pre(gs, ls, D27, a), rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns), rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns), unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps), lstepf(gs, ls, D27, a).addr ∈ gstepf(gs, ls, D27, a).vrvHp, lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp, lstepf(gs, ls, D27, a).lst ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).first, gstepf(gs, ls, D27, a).vtail ∈ gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl from lstepf(gs, ls, D27, a).lst, gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl, lstepf(gs, ls, D27, a).first ∈ gstepf(gs, ls, D27, a).orl, ¬ lstepf(gs, ls, D27, a).success, ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl), gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val), gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null, gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D28 ≠ D29; (s) ⊦ D28 ≠ D30; (s) ⊦ D28 ≠ D31; (s) ⊦ D28 ≠ D34; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ D28 ≠ E1; (s) ⊦ D28 ≠ E12; (s) ⊦ D28 ≠ E17; (s) ⊦ D28 ≠ crashed; (s) ⊦ D28 ≠ idle; (s) ⊦ D28 ≠ ready; (s) ⊦ D1 ≠ D28; (s) ⊦ D2 ≠ D28; (s) ⊦ D3 ≠ D28; (s) ⊦ D4 ≠ D28; (s) ⊦ D5 ≠ D28; (s) ⊦ D6 ≠ D28; (s) ⊦ D7 ≠ D28; (s) ⊦ D8 ≠ D28; (s) ⊦ D9 ≠ D28; (s) ⊦ D10 ≠ D28; (s) ⊦ D11 ≠ D28; (s) ⊦ D12 ≠ D28; (s) ⊦ D13 ≠ D28; (s) ⊦ D14 ≠ D28; (s) ⊦ D15 ≠ D28; (s) ⊦ D16 ≠ D28; (s) ⊦ D17 ≠ D28; (s) ⊦ D18 ≠ D28; (s) ⊦ D19 ≠ D28; (s) ⊦ D20 ≠ D28; (s) ⊦ D21 ≠ D28; (s) ⊦ D22 ≠ D28; (s) ⊦ D23 ≠ D28; (s) ⊦ D24 ≠ D28; (s) ⊦ D25 ≠ D28; (s) ⊦ D26 ≠ D28; (s) ⊦ D27 ≠ D28; (s) ⊦ D28 ≠ E2; (s) ⊦ D28 ≠ E3; (s) ⊦ D28 ≠ E5; (s) ⊦ D28 ≠ E6; (s) ⊦ D28 ≠ E7; (s) ⊦ D28 ≠ E8; (s) ⊦ D28 ≠ E9; (s) ⊦ D28 ≠ E13; (s) ⊦ D28 ≠ E14; (s) ⊦ D28 ≠ E15; (s) ⊦ D28 ≠ E16; (s) ⊦ D28 ≠ E10; (s) ⊦ D28 ≠ E11; (s) ⊦ D28 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ Val(val).val = val; (s) ⊦ gstepf(gs, ls, D27, τ) = gs; (s) ⊦ lstepf(gs, ls, D27, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 469 from proof copied-step-DMSQLInv (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 470 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gs.vhead ≠ ls.first, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D27-D32, seq:⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D32 → ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok (gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv (gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv (gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs (gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D27, a).vs [gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ ( gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = ( gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast ).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D27, a).vs [(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 471 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D32 → ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid (lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns)

Lemma step-D27-D32

Proof step 472 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gs.vhead ≠ ls.first, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a), ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D32 → ( listp (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns) ∧ ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps) ∧ markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs) ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps) ∧ gstepf(gs, ls, D27, a).orl ≠ [] ∧ gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl ∧ rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns) ∧ allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp) ∧ dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp ∧ ( gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs)) ∧ ( gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D27, a).success ∧ gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid)) ∧ ( gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref ∧ lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp ∧ lstepf(gs, ls, D27, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs) ∧ noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 473 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gs.vhead ≠ ls.first, DMSQGInv(gs), DMSQLInv(gs, ls, D27), pre(gs, ls, D27, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D32

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 474 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 475 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gs.orl ≠ [], gs.vhead ≠ ls.first, DMSQLInv(gs, ls, D27), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D27, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D27, a) ∧ pcstepf(gs, ls, D27, a) = D32, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D27], <all paths>

Additional information

Used simplifier rules: ⊦ D27 ≠ crashed; (s) ⊦ D27 ≠ idle; (s) ⊦ D27 ≠ ready; (s) ⊦ D27 ≠ E1; (s) ⊦ D27 ≠ E17; (s) ⊦ D1 ≠ D27; (s) ⊦ D2 ≠ D27; (s) ⊦ D7 ≠ D27; (s) ⊦ D27 ≠ E4; (s) ⊦ D27 ≠ E16; (s) ⊦ D27 ≠ E15; (s) ⊦ D27 ≠ E14; (s) ⊦ D27 ≠ E13; (s) ⊦ D27 ≠ E12; (s) ⊦ D27 ≠ E11; (s) ⊦ D27 ≠ E10; (s) ⊦ D27 ≠ E9; (s) ⊦ D27 ≠ E8; (s) ⊦ D27 ≠ E7; (s) ⊦ D27 ≠ E6; (s) ⊦ D27 ≠ E5; (s) ⊦ D27 ≠ E3; (s) ⊦ D27 ≠ E2; (s) ⊦ D27 ≠ D34; (s) ⊦ D27 ≠ D31; (s) ⊦ D27 ≠ D30; (s) ⊦ D27 ≠ D29; (s) ⊦ D27 ≠ D28; (s) ⊦ D26 ≠ D27; (s) ⊦ D25 ≠ D27; (s) ⊦ D24 ≠ D27; (s) ⊦ D23 ≠ D27; (s) ⊦ D22 ≠ D27; (s) ⊦ D21 ≠ D27; (s) ⊦ D20 ≠ D27; (s) ⊦ D19 ≠ D27; (s) ⊦ D18 ≠ D27; (s) ⊦ D17 ≠ D27; (s) ⊦ D16 ≠ D27; (s) ⊦ D15 ≠ D27; (s) ⊦ D14 ≠ D27; (s) ⊦ D13 ≠ D27; (s) ⊦ D12 ≠ D27; (s) ⊦ D11 ≠ D27; (s) ⊦ D10 ≠ D27; (s) ⊦ D9 ≠ D27; (s) ⊦ D8 ≠ D27; (s) ⊦ D6 ≠ D27; (s) ⊦ D5 ≠ D27; (s) ⊦ D4 ≠ D27; (s) ⊦ D3 ≠ D27; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D27, a) = (gs.vhead = ls.first ⊃ D28;D32); (s) Used terms: gs, ls, D27

Proof step 476 from proof copied-step-DMSQLInv (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 477 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid), gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gstepf(gs, ls, D27, a).orl ≠ [], lstepf(gs, ls, D27, a).rvref ≠ null, gs.vhead ≠ ls.first, DMSQGInv(gs), DMSQLInv(gs, ls, D27), allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp), allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp), listp(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs), nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs), noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), pre(gs, ls, D27, a), rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns), rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns), unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps), gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl, lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp, ¬ lstepf(gs, ls, D27, a).success, ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl), gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val), gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs), gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 478 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 479 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D27, a).pretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, gstepf(gs, ls, D27, a).rvowns(gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid)) = Pending(lstepf(gs, ls, D27, a).tid), gstepf(gs, ls, D27, a).vretRefs(lstepf(gs, ls, D27, a).tid) = lstepf(gs, ls, D27, a).rvref, dom gstepf(gs, ls, D27, a).vrvHp = dom gstepf(gs, ls, D27, a).prvHp, gs0 = gstepf(gs, ls, D27, a), ls0 = lstepf(gs, ls, D27, a), pc0 = D32, gstepf(gs, ls, D27, a).orl ≠ [], lstepf(gs, ls, D27, a).rvref ≠ null, gs.vhead ≠ ls.first, DMSQGInv(gs), DMSQLInv(gs, ls, D27), allocrv(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp), allocrv(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp), listp(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).ps, gstepf(gs, ls, D27, a).owns), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).vs), markedp(gstepf(gs, ls, D27, a).orl, gstepf(gs, ls, D27, a).ps), nextnottid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), noid(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vhead, gstepf(gs, ls, D27, a).vs), nonullRetRefs (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs, gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).pretRefs), noowns(lstepf(gs, ls, D27, a).tid, gstepf(gs, ls, D27, a).owns), pre(gs, ls, D27, a), rvownerok(gstepf(gs, ls, D27, a).pretRefs, gstepf(gs, ls, D27, a).prvHp, gstepf(gs, ls, D27, a).rvowns), rvownerok(gstepf(gs, ls, D27, a).vretRefs, gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).rvowns), unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).ps), lstepf(gs, ls, D27, a).rvref ∈ gstepf(gs, ls, D27, a).vrvHp, gstepf(gs, ls, D27, a).phead ∈ gstepf(gs, ls, D27, a).orl, ¬ lstepf(gs, ls, D27, a).success, ¬ dups(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl), gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next ≠ null ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D27, a).rvowns (gstepf(gs, ls, D27, a).vretRefs(gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].deqID.tid, gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).vhead].next].val), gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last ∨ gstepf(gs, ls, D27, a).qrl ≠ [] ∧ gstepf(gs, ls, D27, a).vtail = (gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl.butlast).last ∧ gstepf(gs, ls, D27, a).vs[gstepf(gs, ls, D27, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D27, a).vs[(gstepf(gs, ls, D27, a).orl + gstepf(gs, ls, D27, a).qrl).last].next = null, gstepf(gs, ls, D27, a).orl.last = gstepf(gs, ls, D27, a).vhead ∧ (gstepf(gs, ls, D27, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D27, a).qrl.tail, gstepf(gs, ls, D27, a).vs)) ∨ gstepf(gs, ls, D27, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D27, a).orl.butlast.last = gstepf(gs, ls, D27, a).vhead ∧ gstepf(gs, ls, D27, a).phead ≠ gstepf(gs, ls, D27, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D27, a).qrl, gstepf(gs, ls, D27, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D27, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D32 ≠ D34; (s) ⊦ D32 ≠ E1; (s) ⊦ D32 ≠ E12; (s) ⊦ D32 ≠ E17; (s) ⊦ D32 ≠ crashed; (s) ⊦ D32 ≠ idle; (s) ⊦ D32 ≠ ready; (s) ⊦ D1 ≠ D32; (s) ⊦ D2 ≠ D32; (s) ⊦ D3 ≠ D32; (s) ⊦ D4 ≠ D32; (s) ⊦ D5 ≠ D32; (s) ⊦ D6 ≠ D32; (s) ⊦ D7 ≠ D32; (s) ⊦ D8 ≠ D32; (s) ⊦ D9 ≠ D32; (s) ⊦ D10 ≠ D32; (s) ⊦ D11 ≠ D32; (s) ⊦ D12 ≠ D32; (s) ⊦ D13 ≠ D32; (s) ⊦ D14 ≠ D32; (s) ⊦ D15 ≠ D32; (s) ⊦ D16 ≠ D32; (s) ⊦ D17 ≠ D32; (s) ⊦ D18 ≠ D32; (s) ⊦ D19 ≠ D32; (s) ⊦ D20 ≠ D32; (s) ⊦ D21 ≠ D32; (s) ⊦ D22 ≠ D32; (s) ⊦ D23 ≠ D32; (s) ⊦ D24 ≠ D32; (s) ⊦ D25 ≠ D32; (s) ⊦ D26 ≠ D32; (s) ⊦ D27 ≠ D32; (s) ⊦ D28 ≠ D32; (s) ⊦ D29 ≠ D32; (s) ⊦ D30 ≠ D32; (s) ⊦ D31 ≠ D32; (s) ⊦ D32 ≠ E2; (s) ⊦ D32 ≠ E3; (s) ⊦ D32 ≠ E5; (s) ⊦ D32 ≠ E6; (s) ⊦ D32 ≠ E7; (s) ⊦ D32 ≠ E8; (s) ⊦ D32 ≠ E9; (s) ⊦ D32 ≠ E13; (s) ⊦ D32 ≠ E14; (s) ⊦ D32 ≠ E15; (s) ⊦ D32 ≠ E16; (s) ⊦ D32 ≠ E10; (s) ⊦ D32 ≠ E11; (s) ⊦ D32 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D27, τ) = gs; (s) ⊦ lstepf(gs, ls, D27, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 480 from proof copied-step-DMSQLInv (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 481 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D28, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 482 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = pcstepf(gs, ls, D28, a), DMSQGInv(gs), DMSQLInv(gs, ls, D28), pre(gs, ls, D28, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D28, seq: ⊦ pcstepf(gs, ls, D28, a) = D29, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 483 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D28, a) = D29

A spec-lemma

Proof step 484 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, DMSQGInv(gs), DMSQLInv(gs, ls, D28), pre(gs, ls, D28, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D28-D29, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → ( lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl ∧ gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D28, a).nxt ≠ null ∧ lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next ∧ gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed (lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs) ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps) ∧ gstepf(gs, ls, D28, a).orl ≠ [] ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl ∧ rvownerok (gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv (gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv (gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp) ∧ dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp ∧ ( gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs [gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs (gstepf(gs, ls, D28, a).vs [gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D28, a).vs [gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D28, a).vs [gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ ( gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs)) ∧ ( gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = ( gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast ).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D28, a).vs [(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D28, a).success ∧ gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid)) ∧ ( gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).addr ≠ null ∧ lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val)) ∧ nextnottid (lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noid (lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 485 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → ( lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl ∧ gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D28, a).nxt ≠ null ∧ lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next ∧ gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs) ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps) ∧ gstepf(gs, ls, D28, a).orl ≠ [] ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl ∧ rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp) ∧ dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp ∧ ( gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs)) ∧ ( gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D28, a).success ∧ gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid)) ∧ ( gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).addr ≠ null ∧ lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noid (lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns)

Lemma step-D28-D29

Proof step 486 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, DMSQGInv(gs), DMSQLInv(gs, ls, D28), pre(gs, ls, D28, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29 → ( lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl ∧ gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D28, a).nxt ≠ null ∧ lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next ∧ gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps) ∧ markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs) ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps) ∧ gstepf(gs, ls, D28, a).orl ≠ [] ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl ∧ rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns) ∧ allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp) ∧ dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp ∧ ( gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs)) ∧ ( gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D28, a).success ∧ gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid)) ∧ ( gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref ∧ lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp ∧ lstepf(gs, ls, D28, a).addr ≠ null ∧ lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 487 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, DMSQGInv(gs), DMSQLInv(gs, ls, D28), pre(gs, ls, D28, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 488 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 489 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, gs.orl ≠ [], DMSQLInv(gs, ls, D28), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D28, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D28, a) ∧ pcstepf(gs, ls, D28, a) = D29, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D28], <all paths>

Additional information

Used simplifier rules: ⊦ D28 ≠ crashed; (s) ⊦ D28 ≠ idle; (s) ⊦ D28 ≠ ready; (s) ⊦ D28 ≠ E1; (s) ⊦ D28 ≠ E17; (s) ⊦ D1 ≠ D28; (s) ⊦ D2 ≠ D28; (s) ⊦ D7 ≠ D28; (s) ⊦ D28 ≠ E4; (s) ⊦ D28 ≠ E16; (s) ⊦ D28 ≠ E15; (s) ⊦ D28 ≠ E14; (s) ⊦ D28 ≠ E13; (s) ⊦ D28 ≠ E12; (s) ⊦ D28 ≠ E11; (s) ⊦ D28 ≠ E10; (s) ⊦ D28 ≠ E9; (s) ⊦ D28 ≠ E8; (s) ⊦ D28 ≠ E7; (s) ⊦ D28 ≠ E6; (s) ⊦ D28 ≠ E5; (s) ⊦ D28 ≠ E3; (s) ⊦ D28 ≠ E2; (s) ⊦ D28 ≠ D34; (s) ⊦ D28 ≠ D31; (s) ⊦ D28 ≠ D30; (s) ⊦ D28 ≠ D29; (s) ⊦ D27 ≠ D28; (s) ⊦ D26 ≠ D28; (s) ⊦ D25 ≠ D28; (s) ⊦ D24 ≠ D28; (s) ⊦ D23 ≠ D28; (s) ⊦ D22 ≠ D28; (s) ⊦ D21 ≠ D28; (s) ⊦ D20 ≠ D28; (s) ⊦ D19 ≠ D28; (s) ⊦ D18 ≠ D28; (s) ⊦ D17 ≠ D28; (s) ⊦ D16 ≠ D28; (s) ⊦ D15 ≠ D28; (s) ⊦ D14 ≠ D28; (s) ⊦ D13 ≠ D28; (s) ⊦ D12 ≠ D28; (s) ⊦ D11 ≠ D28; (s) ⊦ D10 ≠ D28; (s) ⊦ D9 ≠ D28; (s) ⊦ D8 ≠ D28; (s) ⊦ D6 ≠ D28; (s) ⊦ D5 ≠ D28; (s) ⊦ D4 ≠ D28; (s) ⊦ D3 ≠ D28; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ pcstepf(gs, ls, D28, a) = D29; (s) Used terms: gs, ls, D28

Proof step 490 from proof copied-step-DMSQLInv (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 491 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next, lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val), gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref, gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val), gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid), gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref, dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp, gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, lstepf(gs, ls, D28, a).addr ≠ null, gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None, lstepf(gs, ls, D28, a).nxt ≠ null, gstepf(gs, ls, D28, a).orl ≠ [], lstepf(gs, ls, D28, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D28), allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp), allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp), listp(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns), markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps), markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs), nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs), noid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs), nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs), noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns), pre(gs, ls, D28, a), rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns), rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns), unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps), lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl, lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp, lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp, ¬ lstepf(gs, ls, D28, a).success, ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl), gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val), gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs), gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 492 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 493 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D28, a).nxt = gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).first].next, lstepf(gs, ls, D28, a).optval = Val(gstepf(gs, ls, D28, a).vs[lstepf(gs, ls, D28, a).nxt].val), gstepf(gs, ls, D28, a).pretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref, gstepf(gs, ls, D28, a).rvowns(gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid)) = Pending(lstepf(gs, ls, D28, a).tid), gstepf(gs, ls, D28, a).rvowns(lstepf(gs, ls, D28, a).addr) = Claimed(lstepf(gs, ls, D28, a).othertid, lstepf(gs, ls, D28, a).optval.val), gstepf(gs, ls, D28, a).vretRefs(lstepf(gs, ls, D28, a).tid) = lstepf(gs, ls, D28, a).rvref, dom gstepf(gs, ls, D28, a).vrvHp = dom gstepf(gs, ls, D28, a).prvHp, gs0 = gstepf(gs, ls, D28, a), ls0 = lstepf(gs, ls, D28, a), pc0 = D29, lstepf(gs, ls, D28, a).addr ≠ null, gstepf(gs, ls, D28, a).ps[lstepf(gs, ls, D28, a).nxt].deqID ≠ None, lstepf(gs, ls, D28, a).nxt ≠ null, gstepf(gs, ls, D28, a).orl ≠ [], lstepf(gs, ls, D28, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D28), allocrv(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp), allocrv(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp), listp(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns), markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).vs), markedp(gstepf(gs, ls, D28, a).orl, gstepf(gs, ls, D28, a).ps), nextnottid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs), noid(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs), nonullRetRefs (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).pretRefs), noowns(lstepf(gs, ls, D28, a).tid, gstepf(gs, ls, D28, a).owns), pre(gs, ls, D28, a), rvownerok(gstepf(gs, ls, D28, a).pretRefs, gstepf(gs, ls, D28, a).prvHp, gstepf(gs, ls, D28, a).rvowns), rvownerok(gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).rvowns), unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).ps), lstepf(gs, ls, D28, a).addr ∈ gstepf(gs, ls, D28, a).vrvHp, lstepf(gs, ls, D28, a).rvref ∈ gstepf(gs, ls, D28, a).vrvHp, gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl, lstepf(gs, ls, D28, a).first ∈ gstepf(gs, ls, D28, a).orl, ¬ lstepf(gs, ls, D28, a).success, ¬ dups(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl), gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next ≠ null ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D28, a).rvowns (gstepf(gs, ls, D28, a).vretRefs(gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].deqID.tid, gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).vhead].next].val), gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last ∨ gstepf(gs, ls, D28, a).qrl ≠ [] ∧ gstepf(gs, ls, D28, a).vtail = (gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl.butlast).last ∧ gstepf(gs, ls, D28, a).vs[gstepf(gs, ls, D28, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D28, a).vs[(gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl).last].next = null, gstepf(gs, ls, D28, a).orl.last = gstepf(gs, ls, D28, a).vhead ∧ (gstepf(gs, ls, D28, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D28, a).qrl.tail, gstepf(gs, ls, D28, a).vs)) ∨ gstepf(gs, ls, D28, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D28, a).orl.butlast.last = gstepf(gs, ls, D28, a).vhead ∧ gstepf(gs, ls, D28, a).phead ≠ gstepf(gs, ls, D28, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D28, a) ↔ a = (gs.ps[ls.nxt].deqID = None ⊃ doDeq(ls.othertid);τ); (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.orl:= qrl0).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.orl:= qrl0).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.orl:= qrl0).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.deqID:= opttid).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.orl:= qrl0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ D29 ≠ D30; (s) ⊦ D29 ≠ D31; (s) ⊦ D29 ≠ D34; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.orl:= qrl0).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.orl:= qrl0).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.orl:= qrl0).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.orl:= qrl0).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ D29 ≠ E1; (s) ⊦ D29 ≠ E12; (s) ⊦ D29 ≠ E17; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.orl:= qrl0).orl = qrl0; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.orl:= qrl0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.orl:= qrl0).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ D29 ≠ crashed; (s) ⊦ D29 ≠ idle; (s) ⊦ D29 ≠ ready; (s) ⊦ D1 ≠ D29; (s) ⊦ D2 ≠ D29; (s) ⊦ D3 ≠ D29; (s) ⊦ D4 ≠ D29; (s) ⊦ D5 ≠ D29; (s) ⊦ D6 ≠ D29; (s) ⊦ D7 ≠ D29; (s) ⊦ D8 ≠ D29; (s) ⊦ D9 ≠ D29; (s) ⊦ D10 ≠ D29; (s) ⊦ D11 ≠ D29; (s) ⊦ D12 ≠ D29; (s) ⊦ D13 ≠ D29; (s) ⊦ D14 ≠ D29; (s) ⊦ D15 ≠ D29; (s) ⊦ D16 ≠ D29; (s) ⊦ D17 ≠ D29; (s) ⊦ D18 ≠ D29; (s) ⊦ D19 ≠ D29; (s) ⊦ D20 ≠ D29; (s) ⊦ D21 ≠ D29; (s) ⊦ D22 ≠ D29; (s) ⊦ D23 ≠ D29; (s) ⊦ D24 ≠ D29; (s) ⊦ D25 ≠ D29; (s) ⊦ D26 ≠ D29; (s) ⊦ D27 ≠ D29; (s) ⊦ D28 ≠ D29; (s) ⊦ gstepf(gs, ls, D28, a) = ( ( gs .ps:= gs.ps[ls.nxt, gs.ps[ls.nxt].deqID:= Some(ls.othertid)]) .orl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl.tail;gs.qrl); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.qrl:= qrl).owns = gs.owns; (s) ⊦ (gs.orl:= qrl0).owns = gs.owns; (s) ⊦ (gs.ps:= ps).owns = gs.owns; (s) ⊦ D29 ≠ E2; (s) ⊦ D29 ≠ E3; (s) ⊦ D29 ≠ E5; (s) ⊦ D29 ≠ E6; (s) ⊦ D29 ≠ E7; (s) ⊦ D29 ≠ E8; (s) ⊦ D29 ≠ E9; (s) ⊦ D29 ≠ E13; (s) ⊦ D29 ≠ E14; (s) ⊦ D29 ≠ E15; (s) ⊦ D29 ≠ E16; (s) ⊦ D29 ≠ E10; (s) ⊦ D29 ≠ E11; (s) ⊦ D29 ≠ E4; (s) ⊦ lstepf(gs, ls, D28, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 494 from proof copied-step-DMSQLInv (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 495 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D29, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 496 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = pcstepf(gs, ls, D29, a), DMSQGInv(gs), DMSQLInv(gs, ls, D29), pre(gs, ls, D29, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D29, seq: ⊦ pcstepf(gs, ls, D29, a) = D30, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 497 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D29, a) = D30

A spec-lemma

Proof step 498 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, DMSQGInv(gs), DMSQLInv(gs, ls, D29), pre(gs, ls, D29, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D29-D30, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → ( lstepf(gs, ls, D29, a).first ∈ gstepf(gs, ls, D29, a).orl ∧ gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D29, a).nxt ≠ null ∧ lstepf(gs, ls, D29, a).nxt = gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).first].next ∧ gstepf(gs, ls, D29, a).rvowns(lstepf(gs, ls, D29, a).addr) = Claimed (lstepf(gs, ls, D29, a).othertid, lstepf(gs, ls, D29, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ ¬ dups(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).ps) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).vs) ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).ps) ∧ gstepf(gs, ls, D29, a).orl ≠ [] ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl ∧ rvownerok (gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv (gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv (gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp) ∧ dom gstepf(gs, ls, D29, a).vrvHp = dom gstepf(gs, ls, D29, a).prvHp ∧ ( gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ≠ null ∧ gstepf(gs, ls, D29, a).vs [gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs (gstepf(gs, ls, D29, a).vs [gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D29, a).vs [gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D29, a).vs [gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D29, a).orl.last = gstepf(gs, ls, D29, a).vhead ∧ ( gstepf(gs, ls, D29, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D29, a).qrl.tail, gstepf(gs, ls, D29, a).vs)) ∨ gstepf(gs, ls, D29, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D29, a).orl.butlast.last = gstepf(gs, ls, D29, a).vhead ∧ gstepf(gs, ls, D29, a).phead ≠ gstepf(gs, ls, D29, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs)) ∧ ( gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last ∨ gstepf(gs, ls, D29, a).qrl ≠ [] ∧ gstepf(gs, ls, D29, a).vtail = ( gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl.butlast ).last ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D29, a).vs [(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D29, a).success ∧ gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid)) = Pending(lstepf(gs, ls, D29, a).tid)) ∧ ( gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ gstepf(gs, ls, D29, a).pretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ lstepf(gs, ls, D29, a).rvref ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D29, a).addr ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).addr ≠ null ∧ lstepf(gs, ls, D29, a).optval = Val(gstepf(gs, ls, D29, a).vs[lstepf(gs, ls, D29, a).nxt].val)) ∧ nextnottid (lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noid (lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noowns(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 499 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → ( lstepf(gs, ls, D29, a).first ∈ gstepf(gs, ls, D29, a).orl ∧ gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D29, a).nxt ≠ null ∧ lstepf(gs, ls, D29, a).nxt = gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).first].next ∧ gstepf(gs, ls, D29, a).rvowns(lstepf(gs, ls, D29, a).addr) = Claimed(lstepf(gs, ls, D29, a).othertid, lstepf(gs, ls, D29, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ ¬ dups(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).ps) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).vs) ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).ps) ∧ gstepf(gs, ls, D29, a).orl ≠ [] ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl ∧ rvownerok(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp) ∧ dom gstepf(gs, ls, D29, a).vrvHp = dom gstepf(gs, ls, D29, a).prvHp ∧ ( gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ≠ null ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs(gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid, gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D29, a).orl.last = gstepf(gs, ls, D29, a).vhead ∧ (gstepf(gs, ls, D29, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D29, a).qrl.tail, gstepf(gs, ls, D29, a).vs)) ∨ gstepf(gs, ls, D29, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D29, a).orl.butlast.last = gstepf(gs, ls, D29, a).vhead ∧ gstepf(gs, ls, D29, a).phead ≠ gstepf(gs, ls, D29, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs)) ∧ ( gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last ∨ gstepf(gs, ls, D29, a).qrl ≠ [] ∧ gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl.butlast).last ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D29, a).vs[(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D29, a).success ∧ gstepf(gs, ls, D29, a).rvowns(gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid)) = Pending(lstepf(gs, ls, D29, a).tid)) ∧ ( gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ gstepf(gs, ls, D29, a).pretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ lstepf(gs, ls, D29, a).rvref ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D29, a).addr ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).addr ≠ null ∧ lstepf(gs, ls, D29, a).optval = Val(gstepf(gs, ls, D29, a).vs[lstepf(gs, ls, D29, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noid (lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noowns(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).owns)

Lemma step-D29-D30

Proof step 500 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, DMSQGInv(gs), DMSQLInv(gs, ls, D29), pre(gs, ls, D29, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30 → ( lstepf(gs, ls, D29, a).first ∈ gstepf(gs, ls, D29, a).orl ∧ gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D29, a).nxt ≠ null ∧ lstepf(gs, ls, D29, a).nxt = gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).first].next ∧ gstepf(gs, ls, D29, a).rvowns(lstepf(gs, ls, D29, a).addr) = Claimed(lstepf(gs, ls, D29, a).othertid, lstepf(gs, ls, D29, a).optval.val)) ∧ ( listp (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ ¬ dups(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).ps) ∧ markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).vs) ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).ps) ∧ gstepf(gs, ls, D29, a).orl ≠ [] ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl ∧ rvownerok(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp, gstepf(gs, ls, D29, a).rvowns) ∧ allocrv(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp) ∧ dom gstepf(gs, ls, D29, a).vrvHp = dom gstepf(gs, ls, D29, a).prvHp ∧ ( gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ≠ null ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs(gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid, gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D29, a).orl.last = gstepf(gs, ls, D29, a).vhead ∧ (gstepf(gs, ls, D29, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D29, a).qrl.tail, gstepf(gs, ls, D29, a).vs)) ∨ gstepf(gs, ls, D29, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D29, a).orl.butlast.last = gstepf(gs, ls, D29, a).vhead ∧ gstepf(gs, ls, D29, a).phead ≠ gstepf(gs, ls, D29, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs)) ∧ ( gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last ∨ gstepf(gs, ls, D29, a).qrl ≠ [] ∧ gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl.butlast).last ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D29, a).vs[(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D29, a).success ∧ gstepf(gs, ls, D29, a).rvowns(gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid)) = Pending(lstepf(gs, ls, D29, a).tid)) ∧ ( gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ gstepf(gs, ls, D29, a).pretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref ∧ lstepf(gs, ls, D29, a).rvref ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).rvref ≠ null) ∧ ( lstepf(gs, ls, D29, a).addr ∈ gstepf(gs, ls, D29, a).vrvHp ∧ lstepf(gs, ls, D29, a).addr ≠ null ∧ lstepf(gs, ls, D29, a).optval = Val(gstepf(gs, ls, D29, a).vs[lstepf(gs, ls, D29, a).nxt].val)) ∧ nextnottid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ noowns(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 501 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, DMSQGInv(gs), DMSQLInv(gs, ls, D29), pre(gs, ls, D29, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 502 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 503 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, gs.orl ≠ [], DMSQLInv(gs, ls, D29), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D29, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D29, a) ∧ pcstepf(gs, ls, D29, a) = D30, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D29], <all paths>

Additional information

Used simplifier rules: ⊦ D29 ≠ crashed; (s) ⊦ D29 ≠ idle; (s) ⊦ D29 ≠ ready; (s) ⊦ D29 ≠ E1; (s) ⊦ D29 ≠ E17; (s) ⊦ D1 ≠ D29; (s) ⊦ D2 ≠ D29; (s) ⊦ D7 ≠ D29; (s) ⊦ D29 ≠ E4; (s) ⊦ D29 ≠ E16; (s) ⊦ D29 ≠ E15; (s) ⊦ D29 ≠ E14; (s) ⊦ D29 ≠ E13; (s) ⊦ D29 ≠ E12; (s) ⊦ D29 ≠ E11; (s) ⊦ D29 ≠ E10; (s) ⊦ D29 ≠ E9; (s) ⊦ D29 ≠ E8; (s) ⊦ D29 ≠ E7; (s) ⊦ D29 ≠ E6; (s) ⊦ D29 ≠ E5; (s) ⊦ D29 ≠ E3; (s) ⊦ D29 ≠ E2; (s) ⊦ D29 ≠ D34; (s) ⊦ D29 ≠ D31; (s) ⊦ D29 ≠ D30; (s) ⊦ D28 ≠ D29; (s) ⊦ D27 ≠ D29; (s) ⊦ D26 ≠ D29; (s) ⊦ D25 ≠ D29; (s) ⊦ D24 ≠ D29; (s) ⊦ D23 ≠ D29; (s) ⊦ D22 ≠ D29; (s) ⊦ D21 ≠ D29; (s) ⊦ D20 ≠ D29; (s) ⊦ D19 ≠ D29; (s) ⊦ D18 ≠ D29; (s) ⊦ D17 ≠ D29; (s) ⊦ D16 ≠ D29; (s) ⊦ D15 ≠ D29; (s) ⊦ D14 ≠ D29; (s) ⊦ D13 ≠ D29; (s) ⊦ D12 ≠ D29; (s) ⊦ D11 ≠ D29; (s) ⊦ D10 ≠ D29; (s) ⊦ D9 ≠ D29; (s) ⊦ D8 ≠ D29; (s) ⊦ D6 ≠ D29; (s) ⊦ D5 ≠ D29; (s) ⊦ D4 ≠ D29; (s) ⊦ D3 ≠ D29; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D29, a) = D30; (s) Used terms: gs, ls, D29

Proof step 504 from proof copied-step-DMSQLInv (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 505 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D29, a).nxt = gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).first].next, lstepf(gs, ls, D29, a).optval = Val(gstepf(gs, ls, D29, a).vs[lstepf(gs, ls, D29, a).nxt].val), gstepf(gs, ls, D29, a).pretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref, gstepf(gs, ls, D29, a).rvowns(lstepf(gs, ls, D29, a).addr) = Claimed(lstepf(gs, ls, D29, a).othertid, lstepf(gs, ls, D29, a).optval.val), gstepf(gs, ls, D29, a).rvowns(gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid)) = Pending(lstepf(gs, ls, D29, a).tid), gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref, dom gstepf(gs, ls, D29, a).vrvHp = dom gstepf(gs, ls, D29, a).prvHp, gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, lstepf(gs, ls, D29, a).addr ≠ null, gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).nxt].deqID ≠ None, lstepf(gs, ls, D29, a).nxt ≠ null, gstepf(gs, ls, D29, a).orl ≠ [], lstepf(gs, ls, D29, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D29), allocrv(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp), allocrv(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp), listp(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns), markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).ps), markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).vs), nextnottid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs), noid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs), nonullRetRefs (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).pretRefs), noowns(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).owns), pre(gs, ls, D29, a), rvownerok(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).rvowns), rvownerok(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp, gstepf(gs, ls, D29, a).rvowns), unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).ps), lstepf(gs, ls, D29, a).first ∈ gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl, lstepf(gs, ls, D29, a).rvref ∈ gstepf(gs, ls, D29, a).vrvHp, lstepf(gs, ls, D29, a).addr ∈ gstepf(gs, ls, D29, a).vrvHp, ¬ lstepf(gs, ls, D29, a).success, ¬ dups(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl), gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ≠ null ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs(gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid, gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].val), gstepf(gs, ls, D29, a).orl.last = gstepf(gs, ls, D29, a).vhead ∧ (gstepf(gs, ls, D29, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D29, a).qrl.tail, gstepf(gs, ls, D29, a).vs)) ∨ gstepf(gs, ls, D29, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D29, a).orl.butlast.last = gstepf(gs, ls, D29, a).vhead ∧ gstepf(gs, ls, D29, a).phead ≠ gstepf(gs, ls, D29, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs), gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last ∨ gstepf(gs, ls, D29, a).qrl ≠ [] ∧ gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl.butlast).last ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D29, a).vs[(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 506 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 507 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D29, a).nxt = gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).first].next, lstepf(gs, ls, D29, a).optval = Val(gstepf(gs, ls, D29, a).vs[lstepf(gs, ls, D29, a).nxt].val), gstepf(gs, ls, D29, a).pretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref, gstepf(gs, ls, D29, a).rvowns(gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid)) = Pending(lstepf(gs, ls, D29, a).tid), gstepf(gs, ls, D29, a).rvowns(lstepf(gs, ls, D29, a).addr) = Claimed(lstepf(gs, ls, D29, a).othertid, lstepf(gs, ls, D29, a).optval.val), gstepf(gs, ls, D29, a).vretRefs(lstepf(gs, ls, D29, a).tid) = lstepf(gs, ls, D29, a).rvref, dom gstepf(gs, ls, D29, a).vrvHp = dom gstepf(gs, ls, D29, a).prvHp, gs0 = gstepf(gs, ls, D29, a), ls0 = lstepf(gs, ls, D29, a), pc0 = D30, lstepf(gs, ls, D29, a).addr ≠ null, gstepf(gs, ls, D29, a).ps[lstepf(gs, ls, D29, a).nxt].deqID ≠ None, lstepf(gs, ls, D29, a).nxt ≠ null, gstepf(gs, ls, D29, a).orl ≠ [], lstepf(gs, ls, D29, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D29), allocrv(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp), allocrv(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp), listp(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns), markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).vs), markedp(gstepf(gs, ls, D29, a).orl, gstepf(gs, ls, D29, a).ps), nextnottid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs), noid(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs), nonullRetRefs (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).pretRefs), noowns(lstepf(gs, ls, D29, a).tid, gstepf(gs, ls, D29, a).owns), pre(gs, ls, D29, a), rvownerok(gstepf(gs, ls, D29, a).pretRefs, gstepf(gs, ls, D29, a).prvHp, gstepf(gs, ls, D29, a).rvowns), rvownerok(gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).rvowns), unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).ps), lstepf(gs, ls, D29, a).addr ∈ gstepf(gs, ls, D29, a).vrvHp, lstepf(gs, ls, D29, a).rvref ∈ gstepf(gs, ls, D29, a).vrvHp, gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl, lstepf(gs, ls, D29, a).first ∈ gstepf(gs, ls, D29, a).orl, ¬ lstepf(gs, ls, D29, a).success, ¬ dups(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl), gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next ≠ null ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D29, a).rvowns (gstepf(gs, ls, D29, a).vretRefs(gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].deqID.tid, gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).vhead].next].val), gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last ∨ gstepf(gs, ls, D29, a).qrl ≠ [] ∧ gstepf(gs, ls, D29, a).vtail = (gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl.butlast).last ∧ gstepf(gs, ls, D29, a).vs[gstepf(gs, ls, D29, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D29, a).vs[(gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl).last].next = null, gstepf(gs, ls, D29, a).orl.last = gstepf(gs, ls, D29, a).vhead ∧ (gstepf(gs, ls, D29, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D29, a).qrl.tail, gstepf(gs, ls, D29, a).vs)) ∨ gstepf(gs, ls, D29, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D29, a).orl.butlast.last = gstepf(gs, ls, D29, a).vhead ∧ gstepf(gs, ls, D29, a).phead ≠ gstepf(gs, ls, D29, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D29, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D30 ≠ D31; (s) ⊦ D30 ≠ D34; (s) ⊦ D30 ≠ E1; (s) ⊦ D30 ≠ E12; (s) ⊦ D30 ≠ E17; (s) ⊦ D30 ≠ crashed; (s) ⊦ D30 ≠ idle; (s) ⊦ D30 ≠ ready; (s) ⊦ D1 ≠ D30; (s) ⊦ D2 ≠ D30; (s) ⊦ D3 ≠ D30; (s) ⊦ D4 ≠ D30; (s) ⊦ D5 ≠ D30; (s) ⊦ D6 ≠ D30; (s) ⊦ D7 ≠ D30; (s) ⊦ D8 ≠ D30; (s) ⊦ D9 ≠ D30; (s) ⊦ D10 ≠ D30; (s) ⊦ D11 ≠ D30; (s) ⊦ D12 ≠ D30; (s) ⊦ D13 ≠ D30; (s) ⊦ D14 ≠ D30; (s) ⊦ D15 ≠ D30; (s) ⊦ D16 ≠ D30; (s) ⊦ D17 ≠ D30; (s) ⊦ D18 ≠ D30; (s) ⊦ D19 ≠ D30; (s) ⊦ D20 ≠ D30; (s) ⊦ D21 ≠ D30; (s) ⊦ D22 ≠ D30; (s) ⊦ D23 ≠ D30; (s) ⊦ D24 ≠ D30; (s) ⊦ D25 ≠ D30; (s) ⊦ D26 ≠ D30; (s) ⊦ D27 ≠ D30; (s) ⊦ D28 ≠ D30; (s) ⊦ D29 ≠ D30; (s) ⊦ D30 ≠ E2; (s) ⊦ D30 ≠ E3; (s) ⊦ D30 ≠ E5; (s) ⊦ D30 ≠ E6; (s) ⊦ D30 ≠ E7; (s) ⊦ D30 ≠ E8; (s) ⊦ D30 ≠ E9; (s) ⊦ D30 ≠ E13; (s) ⊦ D30 ≠ E14; (s) ⊦ D30 ≠ E15; (s) ⊦ D30 ≠ E16; (s) ⊦ D30 ≠ E10; (s) ⊦ D30 ≠ E11; (s) ⊦ D30 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.vrvHp:= vrvHp).ps = gs.ps; (s) ⊦ (gs.vrvHp:= vrvHp).pretRefs = gs.pretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vs = gs.vs; (s) ⊦ Val(val).val = val; (s) ⊦ (gs.vrvHp:= vrvHp).rvowns = gs.rvowns; (s) ⊦ (gs.vrvHp:= vrvHp).vretRefs = gs.vretRefs; (s) ⊦ (gs.vrvHp:= vrvHp).vrvHp = vrvHp; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ gstepf(gs, ls, D29, τ) = gs.vrvHp:= gs.vrvHp[ls.addr, ls.optval]; (s) ⊦ (gs.vrvHp:= vrvHp).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, D29, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 508 from proof copied-step-DMSQLInv (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 509 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D30, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 510 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = pcstepf(gs, ls, D30, a), DMSQGInv(gs), DMSQLInv(gs, ls, D30), pre(gs, ls, D30, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D30, seq: ⊦ pcstepf(gs, ls, D30, a) = D31, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 511 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D30, a) = D31

A spec-lemma

Proof step 512 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, DMSQGInv(gs), DMSQLInv(gs, ls, D30), pre(gs, ls, D30, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D30-D31, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → ( lstepf(gs, ls, D30, a).first ∈ gstepf(gs, ls, D30, a).orl ∧ gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D30, a).nxt ≠ null ∧ lstepf(gs, ls, D30, a).nxt = gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).first].next) ∧ ( listp (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ ¬ dups(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).ps) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).vs) ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).ps) ∧ gstepf(gs, ls, D30, a).orl ≠ [] ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl ∧ rvownerok (gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv (gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv (gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp) ∧ dom gstepf(gs, ls, D30, a).vrvHp = dom gstepf(gs, ls, D30, a).prvHp ∧ ( gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ≠ null ∧ gstepf(gs, ls, D30, a).vs [gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs (gstepf(gs, ls, D30, a).vs [gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D30, a).vs [gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D30, a).vs [gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D30, a).orl.last = gstepf(gs, ls, D30, a).vhead ∧ ( gstepf(gs, ls, D30, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D30, a).qrl.tail, gstepf(gs, ls, D30, a).vs)) ∨ gstepf(gs, ls, D30, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D30, a).orl.butlast.last = gstepf(gs, ls, D30, a).vhead ∧ gstepf(gs, ls, D30, a).phead ≠ gstepf(gs, ls, D30, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs)) ∧ ( gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last ∨ gstepf(gs, ls, D30, a).qrl ≠ [] ∧ gstepf(gs, ls, D30, a).vtail = ( gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl.butlast ).last ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D30, a).vs [(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, D30, a).success ∧ gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid)) = Pending(lstepf(gs, ls, D30, a).tid)) ∧ ( gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ gstepf(gs, ls, D30, a).pretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ lstepf(gs, ls, D30, a).rvref ∈ gstepf(gs, ls, D30, a).vrvHp ∧ lstepf(gs, ls, D30, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noid (lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noowns(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 513 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → ( lstepf(gs, ls, D30, a).first ∈ gstepf(gs, ls, D30, a).orl ∧ gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D30, a).nxt ≠ null ∧ lstepf(gs, ls, D30, a).nxt = gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).first].next) ∧ ( listp (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ ¬ dups(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).ps) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).vs) ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).ps) ∧ gstepf(gs, ls, D30, a).orl ≠ [] ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl ∧ rvownerok(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp) ∧ dom gstepf(gs, ls, D30, a).vrvHp = dom gstepf(gs, ls, D30, a).prvHp ∧ ( gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ≠ null ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs(gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid, gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D30, a).orl.last = gstepf(gs, ls, D30, a).vhead ∧ (gstepf(gs, ls, D30, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D30, a).qrl.tail, gstepf(gs, ls, D30, a).vs)) ∨ gstepf(gs, ls, D30, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D30, a).orl.butlast.last = gstepf(gs, ls, D30, a).vhead ∧ gstepf(gs, ls, D30, a).phead ≠ gstepf(gs, ls, D30, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs)) ∧ ( gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last ∨ gstepf(gs, ls, D30, a).qrl ≠ [] ∧ gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl.butlast).last ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D30, a).vs[(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D30, a).success ∧ gstepf(gs, ls, D30, a).rvowns(gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid)) = Pending(lstepf(gs, ls, D30, a).tid)) ∧ ( gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ gstepf(gs, ls, D30, a).pretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ lstepf(gs, ls, D30, a).rvref ∈ gstepf(gs, ls, D30, a).vrvHp ∧ lstepf(gs, ls, D30, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noid (lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noowns(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).owns)

Lemma step-D30-D31

Proof step 514 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, DMSQGInv(gs), DMSQLInv(gs, ls, D30), pre(gs, ls, D30, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31 → ( lstepf(gs, ls, D30, a).first ∈ gstepf(gs, ls, D30, a).orl ∧ gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D30, a).nxt ≠ null ∧ lstepf(gs, ls, D30, a).nxt = gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).first].next) ∧ ( listp (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ ¬ dups(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).ps) ∧ markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).vs) ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).ps) ∧ gstepf(gs, ls, D30, a).orl ≠ [] ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl ∧ rvownerok(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp, gstepf(gs, ls, D30, a).rvowns) ∧ allocrv(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp) ∧ dom gstepf(gs, ls, D30, a).vrvHp = dom gstepf(gs, ls, D30, a).prvHp ∧ ( gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ≠ null ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs(gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid, gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D30, a).orl.last = gstepf(gs, ls, D30, a).vhead ∧ (gstepf(gs, ls, D30, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D30, a).qrl.tail, gstepf(gs, ls, D30, a).vs)) ∨ gstepf(gs, ls, D30, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D30, a).orl.butlast.last = gstepf(gs, ls, D30, a).vhead ∧ gstepf(gs, ls, D30, a).phead ≠ gstepf(gs, ls, D30, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs)) ∧ ( gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last ∨ gstepf(gs, ls, D30, a).qrl ≠ [] ∧ gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl.butlast).last ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D30, a).vs[(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D30, a).success ∧ gstepf(gs, ls, D30, a).rvowns(gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid)) = Pending(lstepf(gs, ls, D30, a).tid)) ∧ ( gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ gstepf(gs, ls, D30, a).pretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref ∧ lstepf(gs, ls, D30, a).rvref ∈ gstepf(gs, ls, D30, a).vrvHp ∧ lstepf(gs, ls, D30, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ noowns(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 515 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, DMSQGInv(gs), DMSQLInv(gs, ls, D30), pre(gs, ls, D30, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 516 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 517 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, gs.orl ≠ [], DMSQLInv(gs, ls, D30), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D30, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D30, a) ∧ pcstepf(gs, ls, D30, a) = D31, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D30], <all paths>

Additional information

Used simplifier rules: ⊦ D30 ≠ crashed; (s) ⊦ D30 ≠ idle; (s) ⊦ D30 ≠ ready; (s) ⊦ D30 ≠ E1; (s) ⊦ D30 ≠ E17; (s) ⊦ D1 ≠ D30; (s) ⊦ D2 ≠ D30; (s) ⊦ D7 ≠ D30; (s) ⊦ D30 ≠ E4; (s) ⊦ D30 ≠ E16; (s) ⊦ D30 ≠ E15; (s) ⊦ D30 ≠ E14; (s) ⊦ D30 ≠ E13; (s) ⊦ D30 ≠ E12; (s) ⊦ D30 ≠ E11; (s) ⊦ D30 ≠ E10; (s) ⊦ D30 ≠ E9; (s) ⊦ D30 ≠ E8; (s) ⊦ D30 ≠ E7; (s) ⊦ D30 ≠ E6; (s) ⊦ D30 ≠ E5; (s) ⊦ D30 ≠ E3; (s) ⊦ D30 ≠ E2; (s) ⊦ D30 ≠ D34; (s) ⊦ D30 ≠ D31; (s) ⊦ D29 ≠ D30; (s) ⊦ D28 ≠ D30; (s) ⊦ D27 ≠ D30; (s) ⊦ D26 ≠ D30; (s) ⊦ D25 ≠ D30; (s) ⊦ D24 ≠ D30; (s) ⊦ D23 ≠ D30; (s) ⊦ D22 ≠ D30; (s) ⊦ D21 ≠ D30; (s) ⊦ D20 ≠ D30; (s) ⊦ D19 ≠ D30; (s) ⊦ D18 ≠ D30; (s) ⊦ D17 ≠ D30; (s) ⊦ D16 ≠ D30; (s) ⊦ D15 ≠ D30; (s) ⊦ D14 ≠ D30; (s) ⊦ D13 ≠ D30; (s) ⊦ D12 ≠ D30; (s) ⊦ D11 ≠ D30; (s) ⊦ D10 ≠ D30; (s) ⊦ D9 ≠ D30; (s) ⊦ D8 ≠ D30; (s) ⊦ D6 ≠ D30; (s) ⊦ D5 ≠ D30; (s) ⊦ D4 ≠ D30; (s) ⊦ D3 ≠ D30; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D30, a) = D31; (s) Used terms: gs, ls, D30

Proof step 518 from proof copied-step-DMSQLInv (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 519 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D30, a).nxt = gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).first].next, gstepf(gs, ls, D30, a).pretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref, gstepf(gs, ls, D30, a).rvowns(gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid)) = Pending(lstepf(gs, ls, D30, a).tid), gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref, dom gstepf(gs, ls, D30, a).vrvHp = dom gstepf(gs, ls, D30, a).prvHp, gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).nxt].deqID ≠ None, lstepf(gs, ls, D30, a).nxt ≠ null, gstepf(gs, ls, D30, a).orl ≠ [], lstepf(gs, ls, D30, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D30), allocrv(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp), allocrv(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp), listp(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns), markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).ps), markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).vs), nextnottid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs), noid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs), nonullRetRefs (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).pretRefs), noowns(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).owns), pre(gs, ls, D30, a), rvownerok(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).rvowns), rvownerok(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp, gstepf(gs, ls, D30, a).rvowns), unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).ps), lstepf(gs, ls, D30, a).first ∈ gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl, lstepf(gs, ls, D30, a).rvref ∈ gstepf(gs, ls, D30, a).vrvHp, ¬ lstepf(gs, ls, D30, a).success, ¬ dups(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl), gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ≠ null ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs(gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid, gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].val), gstepf(gs, ls, D30, a).orl.last = gstepf(gs, ls, D30, a).vhead ∧ (gstepf(gs, ls, D30, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D30, a).qrl.tail, gstepf(gs, ls, D30, a).vs)) ∨ gstepf(gs, ls, D30, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D30, a).orl.butlast.last = gstepf(gs, ls, D30, a).vhead ∧ gstepf(gs, ls, D30, a).phead ≠ gstepf(gs, ls, D30, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs), gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last ∨ gstepf(gs, ls, D30, a).qrl ≠ [] ∧ gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl.butlast).last ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D30, a).vs[(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 520 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 521 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, D30, a).nxt = gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).first].next, gstepf(gs, ls, D30, a).pretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref, gstepf(gs, ls, D30, a).rvowns(gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid)) = Pending(lstepf(gs, ls, D30, a).tid), gstepf(gs, ls, D30, a).vretRefs(lstepf(gs, ls, D30, a).tid) = lstepf(gs, ls, D30, a).rvref, dom gstepf(gs, ls, D30, a).vrvHp = dom gstepf(gs, ls, D30, a).prvHp, gs0 = gstepf(gs, ls, D30, a), ls0 = lstepf(gs, ls, D30, a), pc0 = D31, gstepf(gs, ls, D30, a).ps[lstepf(gs, ls, D30, a).nxt].deqID ≠ None, lstepf(gs, ls, D30, a).nxt ≠ null, gstepf(gs, ls, D30, a).orl ≠ [], lstepf(gs, ls, D30, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D30), allocrv(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp), allocrv(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp), listp(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns), markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).vs), markedp(gstepf(gs, ls, D30, a).orl, gstepf(gs, ls, D30, a).ps), nextnottid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs), noid(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs), nonullRetRefs (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).pretRefs), noowns(lstepf(gs, ls, D30, a).tid, gstepf(gs, ls, D30, a).owns), pre(gs, ls, D30, a), rvownerok(gstepf(gs, ls, D30, a).pretRefs, gstepf(gs, ls, D30, a).prvHp, gstepf(gs, ls, D30, a).rvowns), rvownerok(gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).rvowns), unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).ps), lstepf(gs, ls, D30, a).rvref ∈ gstepf(gs, ls, D30, a).vrvHp, gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl, lstepf(gs, ls, D30, a).first ∈ gstepf(gs, ls, D30, a).orl, ¬ lstepf(gs, ls, D30, a).success, ¬ dups(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl), gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next ≠ null ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D30, a).rvowns (gstepf(gs, ls, D30, a).vretRefs(gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].deqID.tid, gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).vhead].next].val), gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last ∨ gstepf(gs, ls, D30, a).qrl ≠ [] ∧ gstepf(gs, ls, D30, a).vtail = (gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl.butlast).last ∧ gstepf(gs, ls, D30, a).vs[gstepf(gs, ls, D30, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D30, a).vs[(gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl).last].next = null, gstepf(gs, ls, D30, a).orl.last = gstepf(gs, ls, D30, a).vhead ∧ (gstepf(gs, ls, D30, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D30, a).qrl.tail, gstepf(gs, ls, D30, a).vs)) ∨ gstepf(gs, ls, D30, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D30, a).orl.butlast.last = gstepf(gs, ls, D30, a).vhead ∧ gstepf(gs, ls, D30, a).phead ≠ gstepf(gs, ls, D30, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D30, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D31 ≠ D34; (s) ⊦ D31 ≠ E1; (s) ⊦ D31 ≠ E12; (s) ⊦ D31 ≠ E17; (s) ⊦ D31 ≠ crashed; (s) ⊦ D31 ≠ idle; (s) ⊦ D31 ≠ ready; (s) ⊦ D1 ≠ D31; (s) ⊦ D2 ≠ D31; (s) ⊦ D3 ≠ D31; (s) ⊦ D4 ≠ D31; (s) ⊦ D5 ≠ D31; (s) ⊦ D6 ≠ D31; (s) ⊦ D7 ≠ D31; (s) ⊦ D8 ≠ D31; (s) ⊦ D9 ≠ D31; (s) ⊦ D10 ≠ D31; (s) ⊦ D11 ≠ D31; (s) ⊦ D12 ≠ D31; (s) ⊦ D13 ≠ D31; (s) ⊦ D14 ≠ D31; (s) ⊦ D15 ≠ D31; (s) ⊦ D16 ≠ D31; (s) ⊦ D17 ≠ D31; (s) ⊦ D18 ≠ D31; (s) ⊦ D19 ≠ D31; (s) ⊦ D20 ≠ D31; (s) ⊦ D21 ≠ D31; (s) ⊦ D22 ≠ D31; (s) ⊦ D23 ≠ D31; (s) ⊦ D24 ≠ D31; (s) ⊦ D25 ≠ D31; (s) ⊦ D26 ≠ D31; (s) ⊦ D27 ≠ D31; (s) ⊦ D28 ≠ D31; (s) ⊦ D29 ≠ D31; (s) ⊦ D30 ≠ D31; (s) ⊦ D31 ≠ E2; (s) ⊦ D31 ≠ E3; (s) ⊦ D31 ≠ E5; (s) ⊦ D31 ≠ E6; (s) ⊦ D31 ≠ E7; (s) ⊦ D31 ≠ E8; (s) ⊦ D31 ≠ E9; (s) ⊦ D31 ≠ E13; (s) ⊦ D31 ≠ E14; (s) ⊦ D31 ≠ E15; (s) ⊦ D31 ≠ E16; (s) ⊦ D31 ≠ E10; (s) ⊦ D31 ≠ E11; (s) ⊦ D31 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, D30, τ) = gs.prvHp:= gs.prvHp[ls.addr, gs.vrvHp[ls.addr]]; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ lstepf(gs, ls, D30, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 522 from proof copied-step-DMSQLInv (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 523 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D31, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 524 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = pcstepf(gs, ls, D31, a), DMSQGInv(gs), DMSQLInv(gs, ls, D31), pre(gs, ls, D31, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D31, seq: ⊦ pcstepf(gs, ls, D31, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 525 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D31, a) = D6

A spec-lemma

Proof step 526 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D31), pre(gs, ls, D31, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D31-D6, seq:⊦ ( ( ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → ( ( lstepf(gs, ls, D31, a).success → lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).vrvHp[lstepf(gs, ls, D31, a).rvref] ∧ lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).prvHp[lstepf(gs, ls, D31, a).rvref]) ∧ gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid)) = ( lstepf(gs, ls, D31, a).optval = Empty ∨ ¬ lstepf(gs, ls, D31, a).success ⊃ Pending(lstepf(gs, ls, D31, a).tid) ;Claimed (lstepf(gs, ls, D31, a).tid, lstepf(gs, ls, D31, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ ¬ dups(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).ps) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).vs) ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).ps) ∧ gstepf(gs, ls, D31, a).orl ≠ [] ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl ∧ rvownerok (gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv (gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv (gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp) ∧ dom gstepf(gs, ls, D31, a).vrvHp = dom gstepf(gs, ls, D31, a).prvHp ∧ ( gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ≠ null ∧ gstepf(gs, ls, D31, a).vs [gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs (gstepf(gs, ls, D31, a).vs [gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D31, a).vs [gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D31, a).vs [gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D31, a).orl.last = gstepf(gs, ls, D31, a).vhead ∧ ( gstepf(gs, ls, D31, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D31, a).qrl.tail, gstepf(gs, ls, D31, a).vs)) ∨ gstepf(gs, ls, D31, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D31, a).orl.butlast.last = gstepf(gs, ls, D31, a).vhead ∧ gstepf(gs, ls, D31, a).phead ≠ gstepf(gs, ls, D31, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs)) ∧ ( gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last ∨ gstepf(gs, ls, D31, a).qrl ≠ [] ∧ gstepf(gs, ls, D31, a).vtail = ( gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl.butlast ).last ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D31, a).vs [(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ gstepf(gs, ls, D31, a).pretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ lstepf(gs, ls, D31, a).rvref ∈ gstepf(gs, ls, D31, a).vrvHp ∧ lstepf(gs, ls, D31, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noid (lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noowns(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 527 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → ( ( lstepf(gs, ls, D31, a).success → lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).vrvHp[lstepf(gs, ls, D31, a).rvref] ∧ lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).prvHp[lstepf(gs, ls, D31, a).rvref]) ∧ gstepf(gs, ls, D31, a).rvowns(gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid)) = (lstepf(gs, ls, D31, a).optval = Empty ∨ ¬ lstepf(gs, ls, D31, a).success ⊃ Pending(lstepf(gs, ls, D31, a).tid) ;Claimed(lstepf(gs, ls, D31, a).tid, lstepf(gs, ls, D31, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ ¬ dups(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).ps) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).vs) ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).ps) ∧ gstepf(gs, ls, D31, a).orl ≠ [] ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl ∧ rvownerok(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp) ∧ dom gstepf(gs, ls, D31, a).vrvHp = dom gstepf(gs, ls, D31, a).prvHp ∧ ( gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ≠ null ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs(gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid, gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D31, a).orl.last = gstepf(gs, ls, D31, a).vhead ∧ (gstepf(gs, ls, D31, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D31, a).qrl.tail, gstepf(gs, ls, D31, a).vs)) ∨ gstepf(gs, ls, D31, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D31, a).orl.butlast.last = gstepf(gs, ls, D31, a).vhead ∧ gstepf(gs, ls, D31, a).phead ≠ gstepf(gs, ls, D31, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs)) ∧ ( gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last ∨ gstepf(gs, ls, D31, a).qrl ≠ [] ∧ gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl.butlast).last ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D31, a).vs[(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ gstepf(gs, ls, D31, a).pretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ lstepf(gs, ls, D31, a).rvref ∈ gstepf(gs, ls, D31, a).vrvHp ∧ lstepf(gs, ls, D31, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noid (lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noowns(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).owns)

Lemma step-D31-D6

Proof step 528 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D31), pre(gs, ls, D31, a), ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6 → ( ( lstepf(gs, ls, D31, a).success → lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).vrvHp[lstepf(gs, ls, D31, a).rvref] ∧ lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).prvHp[lstepf(gs, ls, D31, a).rvref]) ∧ gstepf(gs, ls, D31, a).rvowns(gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid)) = (lstepf(gs, ls, D31, a).optval = Empty ∨ ¬ lstepf(gs, ls, D31, a).success ⊃ Pending(lstepf(gs, ls, D31, a).tid) ;Claimed(lstepf(gs, ls, D31, a).tid, lstepf(gs, ls, D31, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ ¬ dups(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).ps) ∧ markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).vs) ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).ps) ∧ gstepf(gs, ls, D31, a).orl ≠ [] ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl ∧ rvownerok(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp, gstepf(gs, ls, D31, a).rvowns) ∧ allocrv(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp) ∧ dom gstepf(gs, ls, D31, a).vrvHp = dom gstepf(gs, ls, D31, a).prvHp ∧ ( gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ≠ null ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs(gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid, gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D31, a).orl.last = gstepf(gs, ls, D31, a).vhead ∧ (gstepf(gs, ls, D31, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D31, a).qrl.tail, gstepf(gs, ls, D31, a).vs)) ∨ gstepf(gs, ls, D31, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D31, a).orl.butlast.last = gstepf(gs, ls, D31, a).vhead ∧ gstepf(gs, ls, D31, a).phead ≠ gstepf(gs, ls, D31, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs)) ∧ ( gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last ∨ gstepf(gs, ls, D31, a).qrl ≠ [] ∧ gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl.butlast).last ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D31, a).vs[(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ gstepf(gs, ls, D31, a).pretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref ∧ lstepf(gs, ls, D31, a).rvref ∈ gstepf(gs, ls, D31, a).vrvHp ∧ lstepf(gs, ls, D31, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ noowns(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 529 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D31), pre(gs, ls, D31, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 530 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 531 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D31), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D31, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D31, a) ∧ pcstepf(gs, ls, D31, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D31], <all paths>

Additional information

Used simplifier rules: ⊦ D31 ≠ crashed; (s) ⊦ D31 ≠ idle; (s) ⊦ D31 ≠ ready; (s) ⊦ D31 ≠ E1; (s) ⊦ D31 ≠ E17; (s) ⊦ D1 ≠ D31; (s) ⊦ D2 ≠ D31; (s) ⊦ D7 ≠ D31; (s) ⊦ D31 ≠ E4; (s) ⊦ D31 ≠ E16; (s) ⊦ D31 ≠ E15; (s) ⊦ D31 ≠ E14; (s) ⊦ D31 ≠ E13; (s) ⊦ D31 ≠ E12; (s) ⊦ D31 ≠ E11; (s) ⊦ D31 ≠ E10; (s) ⊦ D31 ≠ E9; (s) ⊦ D31 ≠ E8; (s) ⊦ D31 ≠ E7; (s) ⊦ D31 ≠ E6; (s) ⊦ D31 ≠ E5; (s) ⊦ D31 ≠ E3; (s) ⊦ D31 ≠ E2; (s) ⊦ D31 ≠ D34; (s) ⊦ D30 ≠ D31; (s) ⊦ D29 ≠ D31; (s) ⊦ D28 ≠ D31; (s) ⊦ D27 ≠ D31; (s) ⊦ D26 ≠ D31; (s) ⊦ D25 ≠ D31; (s) ⊦ D24 ≠ D31; (s) ⊦ D23 ≠ D31; (s) ⊦ D22 ≠ D31; (s) ⊦ D21 ≠ D31; (s) ⊦ D20 ≠ D31; (s) ⊦ D19 ≠ D31; (s) ⊦ D18 ≠ D31; (s) ⊦ D17 ≠ D31; (s) ⊦ D16 ≠ D31; (s) ⊦ D15 ≠ D31; (s) ⊦ D14 ≠ D31; (s) ⊦ D13 ≠ D31; (s) ⊦ D12 ≠ D31; (s) ⊦ D11 ≠ D31; (s) ⊦ D10 ≠ D31; (s) ⊦ D9 ≠ D31; (s) ⊦ D8 ≠ D31; (s) ⊦ D6 ≠ D31; (s) ⊦ D5 ≠ D31; (s) ⊦ D4 ≠ D31; (s) ⊦ D3 ≠ D31; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D31, a) = D6; (s) Used terms: gs, ls, D31

Proof step 532 from proof copied-step-DMSQLInv (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 533 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D31, a).pretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref, gstepf(gs, ls, D31, a).rvowns(gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid)) = (lstepf(gs, ls, D31, a).optval = Empty ∨ ¬ lstepf(gs, ls, D31, a).success ⊃ Pending(lstepf(gs, ls, D31, a).tid) ;Claimed(lstepf(gs, ls, D31, a).tid, lstepf(gs, ls, D31, a).optval.val) ), gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref, dom gstepf(gs, ls, D31, a).vrvHp = dom gstepf(gs, ls, D31, a).prvHp, gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, gstepf(gs, ls, D31, a).orl ≠ [], lstepf(gs, ls, D31, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D31), allocrv(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp), allocrv(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp), listp(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns), markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).ps), markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).vs), nextnottid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs), noid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs), nonullRetRefs (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).pretRefs), noowns(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).owns), pre(gs, ls, D31, a), rvownerok(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).rvowns), rvownerok(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp, gstepf(gs, ls, D31, a).rvowns), unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).ps), gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl, lstepf(gs, ls, D31, a).rvref ∈ gstepf(gs, ls, D31, a).vrvHp, ¬ dups(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl), lstepf(gs, ls, D31, a).success → lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).vrvHp[lstepf(gs, ls, D31, a).rvref] ∧ lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).prvHp[lstepf(gs, ls, D31, a).rvref], gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ≠ null ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs(gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid, gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].val), gstepf(gs, ls, D31, a).orl.last = gstepf(gs, ls, D31, a).vhead ∧ (gstepf(gs, ls, D31, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D31, a).qrl.tail, gstepf(gs, ls, D31, a).vs)) ∨ gstepf(gs, ls, D31, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D31, a).orl.butlast.last = gstepf(gs, ls, D31, a).vhead ∧ gstepf(gs, ls, D31, a).phead ≠ gstepf(gs, ls, D31, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs), gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last ∨ gstepf(gs, ls, D31, a).qrl ≠ [] ∧ gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl.butlast).last ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D31, a).vs[(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 534 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 535 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D31, a).pretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref, gstepf(gs, ls, D31, a).rvowns(gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid)) = (lstepf(gs, ls, D31, a).optval = Empty ∨ ¬ lstepf(gs, ls, D31, a).success ⊃ Pending(lstepf(gs, ls, D31, a).tid) ;Claimed(lstepf(gs, ls, D31, a).tid, lstepf(gs, ls, D31, a).optval.val) ), gstepf(gs, ls, D31, a).vretRefs(lstepf(gs, ls, D31, a).tid) = lstepf(gs, ls, D31, a).rvref, dom gstepf(gs, ls, D31, a).vrvHp = dom gstepf(gs, ls, D31, a).prvHp, gs0 = gstepf(gs, ls, D31, a), ls0 = lstepf(gs, ls, D31, a), pc0 = D6, gstepf(gs, ls, D31, a).orl ≠ [], lstepf(gs, ls, D31, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D31), allocrv(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp), allocrv(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp), listp(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns), markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).vs), markedp(gstepf(gs, ls, D31, a).orl, gstepf(gs, ls, D31, a).ps), nextnottid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs), noid(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs), nonullRetRefs (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).pretRefs), noowns(lstepf(gs, ls, D31, a).tid, gstepf(gs, ls, D31, a).owns), pre(gs, ls, D31, a), rvownerok(gstepf(gs, ls, D31, a).pretRefs, gstepf(gs, ls, D31, a).prvHp, gstepf(gs, ls, D31, a).rvowns), rvownerok(gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).rvowns), unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).ps), lstepf(gs, ls, D31, a).rvref ∈ gstepf(gs, ls, D31, a).vrvHp, gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl, ¬ dups(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl), gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next ≠ null ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D31, a).rvowns (gstepf(gs, ls, D31, a).vretRefs(gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].deqID.tid, gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).vhead].next].val), lstepf(gs, ls, D31, a).success → lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).vrvHp[lstepf(gs, ls, D31, a).rvref] ∧ lstepf(gs, ls, D31, a).optval = gstepf(gs, ls, D31, a).prvHp[lstepf(gs, ls, D31, a).rvref], gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last ∨ gstepf(gs, ls, D31, a).qrl ≠ [] ∧ gstepf(gs, ls, D31, a).vtail = (gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl.butlast).last ∧ gstepf(gs, ls, D31, a).vs[gstepf(gs, ls, D31, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D31, a).vs[(gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl).last].next = null, gstepf(gs, ls, D31, a).orl.last = gstepf(gs, ls, D31, a).vhead ∧ (gstepf(gs, ls, D31, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D31, a).qrl.tail, gstepf(gs, ls, D31, a).vs)) ∨ gstepf(gs, ls, D31, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D31, a).orl.butlast.last = gstepf(gs, ls, D31, a).vhead ∧ gstepf(gs, ls, D31, a).phead ≠ gstepf(gs, ls, D31, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D31, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ gstepf(gs, ls, D31, a) = (gs.vhead = ls.first ⊃ gs.vhead:= ls.nxt;gs); (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) ⊦ lstepf(gs, ls, D31, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 536 from proof copied-step-DMSQLInv (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 537 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D32, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 538 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = pcstepf(gs, ls, D32, a), DMSQGInv(gs), DMSQLInv(gs, ls, D32), pre(gs, ls, D32, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D32, seq: ⊦ pcstepf(gs, ls, D32, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 539 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D32, a) = D6

A spec-lemma

Proof step 540 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D32), pre(gs, ls, D32, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D32-D6, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D32, a) ∧ pcstepf(gs, ls, D32, a) = D6 → ( ( lstepf(gs, ls, D32, a).success → lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).vrvHp[lstepf(gs, ls, D32, a).rvref] ∧ lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).prvHp[lstepf(gs, ls, D32, a).rvref]) ∧ gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid)) = ( lstepf(gs, ls, D32, a).optval = Empty ∨ ¬ lstepf(gs, ls, D32, a).success ⊃ Pending(lstepf(gs, ls, D32, a).tid) ;Claimed (lstepf(gs, ls, D32, a).tid, lstepf(gs, ls, D32, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).ps, gstepf(gs, ls, D32, a).owns) ∧ ¬ dups(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).ps) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).vs) ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).ps) ∧ gstepf(gs, ls, D32, a).orl ≠ [] ∧ gstepf(gs, ls, D32, a).phead ∈ gstepf(gs, ls, D32, a).orl ∧ rvownerok (gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv (gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv (gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp) ∧ dom gstepf(gs, ls, D32, a).vrvHp = dom gstepf(gs, ls, D32, a).prvHp ∧ ( gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ≠ null ∧ gstepf(gs, ls, D32, a).vs [gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs (gstepf(gs, ls, D32, a).vs [gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D32, a).vs [gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D32, a).vs [gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D32, a).orl.last = gstepf(gs, ls, D32, a).vhead ∧ ( gstepf(gs, ls, D32, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D32, a).qrl.tail, gstepf(gs, ls, D32, a).vs)) ∨ gstepf(gs, ls, D32, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D32, a).orl.butlast.last = gstepf(gs, ls, D32, a).vhead ∧ gstepf(gs, ls, D32, a).phead ≠ gstepf(gs, ls, D32, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs)) ∧ ( gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last ∨ gstepf(gs, ls, D32, a).qrl ≠ [] ∧ gstepf(gs, ls, D32, a).vtail = ( gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl.butlast ).last ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D32, a).vs [(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ gstepf(gs, ls, D32, a).pretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ lstepf(gs, ls, D32, a).rvref ∈ gstepf(gs, ls, D32, a).vrvHp ∧ lstepf(gs, ls, D32, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noid (lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noowns(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 541 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D32, a) ∧ pcstepf(gs, ls, D32, a) = D6 → ( ( lstepf(gs, ls, D32, a).success → lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).vrvHp[lstepf(gs, ls, D32, a).rvref] ∧ lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).prvHp[lstepf(gs, ls, D32, a).rvref]) ∧ gstepf(gs, ls, D32, a).rvowns(gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid)) = (lstepf(gs, ls, D32, a).optval = Empty ∨ ¬ lstepf(gs, ls, D32, a).success ⊃ Pending(lstepf(gs, ls, D32, a).tid) ;Claimed(lstepf(gs, ls, D32, a).tid, lstepf(gs, ls, D32, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).ps, gstepf(gs, ls, D32, a).owns) ∧ ¬ dups(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).ps) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).vs) ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).ps) ∧ gstepf(gs, ls, D32, a).orl ≠ [] ∧ gstepf(gs, ls, D32, a).phead ∈ gstepf(gs, ls, D32, a).orl ∧ rvownerok(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp) ∧ dom gstepf(gs, ls, D32, a).vrvHp = dom gstepf(gs, ls, D32, a).prvHp ∧ ( gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ≠ null ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs(gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid, gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D32, a).orl.last = gstepf(gs, ls, D32, a).vhead ∧ (gstepf(gs, ls, D32, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D32, a).qrl.tail, gstepf(gs, ls, D32, a).vs)) ∨ gstepf(gs, ls, D32, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D32, a).orl.butlast.last = gstepf(gs, ls, D32, a).vhead ∧ gstepf(gs, ls, D32, a).phead ≠ gstepf(gs, ls, D32, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs)) ∧ ( gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last ∨ gstepf(gs, ls, D32, a).qrl ≠ [] ∧ gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl.butlast).last ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D32, a).vs[(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ gstepf(gs, ls, D32, a).pretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ lstepf(gs, ls, D32, a).rvref ∈ gstepf(gs, ls, D32, a).vrvHp ∧ lstepf(gs, ls, D32, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noid (lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noowns(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).owns)

Lemma step-D32-D6

Proof step 542 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D32), pre(gs, ls, D32, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D32, a) ∧ pcstepf(gs, ls, D32, a) = D6 → ( ( lstepf(gs, ls, D32, a).success → lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).vrvHp[lstepf(gs, ls, D32, a).rvref] ∧ lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).prvHp[lstepf(gs, ls, D32, a).rvref]) ∧ gstepf(gs, ls, D32, a).rvowns(gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid)) = (lstepf(gs, ls, D32, a).optval = Empty ∨ ¬ lstepf(gs, ls, D32, a).success ⊃ Pending(lstepf(gs, ls, D32, a).tid) ;Claimed(lstepf(gs, ls, D32, a).tid, lstepf(gs, ls, D32, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).ps, gstepf(gs, ls, D32, a).owns) ∧ ¬ dups(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).ps) ∧ markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).vs) ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).ps) ∧ gstepf(gs, ls, D32, a).orl ≠ [] ∧ gstepf(gs, ls, D32, a).phead ∈ gstepf(gs, ls, D32, a).orl ∧ rvownerok(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp, gstepf(gs, ls, D32, a).rvowns) ∧ allocrv(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp) ∧ dom gstepf(gs, ls, D32, a).vrvHp = dom gstepf(gs, ls, D32, a).prvHp ∧ ( gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ≠ null ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs(gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid, gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D32, a).orl.last = gstepf(gs, ls, D32, a).vhead ∧ (gstepf(gs, ls, D32, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D32, a).qrl.tail, gstepf(gs, ls, D32, a).vs)) ∨ gstepf(gs, ls, D32, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D32, a).orl.butlast.last = gstepf(gs, ls, D32, a).vhead ∧ gstepf(gs, ls, D32, a).phead ≠ gstepf(gs, ls, D32, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs)) ∧ ( gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last ∨ gstepf(gs, ls, D32, a).qrl ≠ [] ∧ gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl.butlast).last ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D32, a).vs[(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ gstepf(gs, ls, D32, a).pretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref ∧ lstepf(gs, ls, D32, a).rvref ∈ gstepf(gs, ls, D32, a).vrvHp ∧ lstepf(gs, ls, D32, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs) ∧ noowns(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 543 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D32), pre(gs, ls, D32, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D32, a) ∧ pcstepf(gs, ls, D32, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 544 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 545 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D32), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D32, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D32, a) ∧ pcstepf(gs, ls, D32, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D32], <all paths>

Additional information

Used simplifier rules: ⊦ D32 ≠ crashed; (s) ⊦ D32 ≠ idle; (s) ⊦ D32 ≠ ready; (s) ⊦ D32 ≠ E1; (s) ⊦ D32 ≠ E17; (s) ⊦ D1 ≠ D32; (s) ⊦ D2 ≠ D32; (s) ⊦ D7 ≠ D32; (s) ⊦ D32 ≠ E4; (s) ⊦ D32 ≠ E16; (s) ⊦ D32 ≠ E15; (s) ⊦ D32 ≠ E14; (s) ⊦ D32 ≠ E13; (s) ⊦ D32 ≠ E12; (s) ⊦ D32 ≠ E11; (s) ⊦ D32 ≠ E10; (s) ⊦ D32 ≠ E9; (s) ⊦ D32 ≠ E8; (s) ⊦ D32 ≠ E7; (s) ⊦ D32 ≠ E6; (s) ⊦ D32 ≠ E5; (s) ⊦ D32 ≠ E3; (s) ⊦ D32 ≠ E2; (s) ⊦ D32 ≠ D34; (s) ⊦ D31 ≠ D32; (s) ⊦ D30 ≠ D32; (s) ⊦ D29 ≠ D32; (s) ⊦ D28 ≠ D32; (s) ⊦ D27 ≠ D32; (s) ⊦ D26 ≠ D32; (s) ⊦ D25 ≠ D32; (s) ⊦ D24 ≠ D32; (s) ⊦ D23 ≠ D32; (s) ⊦ D22 ≠ D32; (s) ⊦ D21 ≠ D32; (s) ⊦ D20 ≠ D32; (s) ⊦ D19 ≠ D32; (s) ⊦ D18 ≠ D32; (s) ⊦ D17 ≠ D32; (s) ⊦ D16 ≠ D32; (s) ⊦ D15 ≠ D32; (s) ⊦ D14 ≠ D32; (s) ⊦ D13 ≠ D32; (s) ⊦ D12 ≠ D32; (s) ⊦ D11 ≠ D32; (s) ⊦ D10 ≠ D32; (s) ⊦ D9 ≠ D32; (s) ⊦ D8 ≠ D32; (s) ⊦ D6 ≠ D32; (s) ⊦ D5 ≠ D32; (s) ⊦ D4 ≠ D32; (s) ⊦ D3 ≠ D32; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D32, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D32, a) = D6; (s) Used terms: gs, ls, D32

Proof step 546 from proof copied-step-DMSQLInv (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 547 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D32, a).pretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref, gstepf(gs, ls, D32, a).rvowns(gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid)) = (lstepf(gs, ls, D32, a).optval = Empty ∨ ¬ lstepf(gs, ls, D32, a).success ⊃ Pending(lstepf(gs, ls, D32, a).tid) ;Claimed(lstepf(gs, ls, D32, a).tid, lstepf(gs, ls, D32, a).optval.val) ), gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref, dom gstepf(gs, ls, D32, a).vrvHp = dom gstepf(gs, ls, D32, a).prvHp, gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, gstepf(gs, ls, D32, a).orl ≠ [], lstepf(gs, ls, D32, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D32), allocrv(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp), allocrv(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp), listp(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).ps, gstepf(gs, ls, D32, a).owns), markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).ps), markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).vs), nextnottid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs), noid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs), nonullRetRefs (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).pretRefs), noowns(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).owns), pre(gs, ls, D32, a), rvownerok(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).rvowns), rvownerok(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp, gstepf(gs, ls, D32, a).rvowns), unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).ps), gstepf(gs, ls, D32, a).phead ∈ gstepf(gs, ls, D32, a).orl, lstepf(gs, ls, D32, a).rvref ∈ gstepf(gs, ls, D32, a).vrvHp, ¬ dups(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl), lstepf(gs, ls, D32, a).success → lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).vrvHp[lstepf(gs, ls, D32, a).rvref] ∧ lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).prvHp[lstepf(gs, ls, D32, a).rvref], gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ≠ null ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs(gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid, gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].val), gstepf(gs, ls, D32, a).orl.last = gstepf(gs, ls, D32, a).vhead ∧ (gstepf(gs, ls, D32, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D32, a).qrl.tail, gstepf(gs, ls, D32, a).vs)) ∨ gstepf(gs, ls, D32, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D32, a).orl.butlast.last = gstepf(gs, ls, D32, a).vhead ∧ gstepf(gs, ls, D32, a).phead ≠ gstepf(gs, ls, D32, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs), gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last ∨ gstepf(gs, ls, D32, a).qrl ≠ [] ∧ gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl.butlast).last ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D32, a).vs[(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 548 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 549 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D32, a).pretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref, gstepf(gs, ls, D32, a).rvowns(gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid)) = (lstepf(gs, ls, D32, a).optval = Empty ∨ ¬ lstepf(gs, ls, D32, a).success ⊃ Pending(lstepf(gs, ls, D32, a).tid) ;Claimed(lstepf(gs, ls, D32, a).tid, lstepf(gs, ls, D32, a).optval.val) ), gstepf(gs, ls, D32, a).vretRefs(lstepf(gs, ls, D32, a).tid) = lstepf(gs, ls, D32, a).rvref, dom gstepf(gs, ls, D32, a).vrvHp = dom gstepf(gs, ls, D32, a).prvHp, gs0 = gstepf(gs, ls, D32, a), ls0 = lstepf(gs, ls, D32, a), pc0 = D6, gstepf(gs, ls, D32, a).orl ≠ [], lstepf(gs, ls, D32, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D32), allocrv(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp), allocrv(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp), listp(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).ps, gstepf(gs, ls, D32, a).owns), markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).vs), markedp(gstepf(gs, ls, D32, a).orl, gstepf(gs, ls, D32, a).ps), nextnottid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs), noid(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vhead, gstepf(gs, ls, D32, a).vs), nonullRetRefs (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs, gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).pretRefs), noowns(lstepf(gs, ls, D32, a).tid, gstepf(gs, ls, D32, a).owns), pre(gs, ls, D32, a), rvownerok(gstepf(gs, ls, D32, a).pretRefs, gstepf(gs, ls, D32, a).prvHp, gstepf(gs, ls, D32, a).rvowns), rvownerok(gstepf(gs, ls, D32, a).vretRefs, gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).rvowns), unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).ps), lstepf(gs, ls, D32, a).rvref ∈ gstepf(gs, ls, D32, a).vrvHp, gstepf(gs, ls, D32, a).phead ∈ gstepf(gs, ls, D32, a).orl, ¬ dups(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl), gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next ≠ null ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D32, a).rvowns (gstepf(gs, ls, D32, a).vretRefs(gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].deqID.tid, gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).vhead].next].val), lstepf(gs, ls, D32, a).success → lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).vrvHp[lstepf(gs, ls, D32, a).rvref] ∧ lstepf(gs, ls, D32, a).optval = gstepf(gs, ls, D32, a).prvHp[lstepf(gs, ls, D32, a).rvref], gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last ∨ gstepf(gs, ls, D32, a).qrl ≠ [] ∧ gstepf(gs, ls, D32, a).vtail = (gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl.butlast).last ∧ gstepf(gs, ls, D32, a).vs[gstepf(gs, ls, D32, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D32, a).vs[(gstepf(gs, ls, D32, a).orl + gstepf(gs, ls, D32, a).qrl).last].next = null, gstepf(gs, ls, D32, a).orl.last = gstepf(gs, ls, D32, a).vhead ∧ (gstepf(gs, ls, D32, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D32, a).qrl.tail, gstepf(gs, ls, D32, a).vs)) ∨ gstepf(gs, ls, D32, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D32, a).orl.butlast.last = gstepf(gs, ls, D32, a).vhead ∧ gstepf(gs, ls, D32, a).phead ≠ gstepf(gs, ls, D32, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D32, a).qrl, gstepf(gs, ls, D32, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D32, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D32, τ) = gs; (s) ⊦ lstepf(gs, ls, D32, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 550 from proof copied-step-DMSQLInv (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 551 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D33, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 552 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = pcstepf(gs, ls, D33, a), DMSQGInv(gs), DMSQLInv(gs, ls, D33), pre(gs, ls, D33, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D33, seq: ⊦ pcstepf(gs, ls, D33, a) = D6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 553 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D33, a) = D6

A spec-lemma

Proof step 554 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D33), pre(gs, ls, D33, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D33-D6, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ ( gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D33, a) ∧ pcstepf(gs, ls, D33, a) = D6 → ( ( lstepf(gs, ls, D33, a).success → lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).vrvHp[lstepf(gs, ls, D33, a).rvref] ∧ lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).prvHp[lstepf(gs, ls, D33, a).rvref]) ∧ gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid)) = ( lstepf(gs, ls, D33, a).optval = Empty ∨ ¬ lstepf(gs, ls, D33, a).success ⊃ Pending(lstepf(gs, ls, D33, a).tid) ;Claimed (lstepf(gs, ls, D33, a).tid, lstepf(gs, ls, D33, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).ps, gstepf(gs, ls, D33, a).owns) ∧ ¬ dups(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).ps) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).vs) ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).ps) ∧ gstepf(gs, ls, D33, a).orl ≠ [] ∧ gstepf(gs, ls, D33, a).phead ∈ gstepf(gs, ls, D33, a).orl ∧ rvownerok (gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv (gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv (gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp) ∧ dom gstepf(gs, ls, D33, a).vrvHp = dom gstepf(gs, ls, D33, a).prvHp ∧ ( gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ≠ null ∧ gstepf(gs, ls, D33, a).vs [gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs (gstepf(gs, ls, D33, a).vs [gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D33, a).vs [gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D33, a).vs [gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D33, a).orl.last = gstepf(gs, ls, D33, a).vhead ∧ ( gstepf(gs, ls, D33, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D33, a).qrl.tail, gstepf(gs, ls, D33, a).vs)) ∨ gstepf(gs, ls, D33, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D33, a).orl.butlast.last = gstepf(gs, ls, D33, a).vhead ∧ gstepf(gs, ls, D33, a).phead ≠ gstepf(gs, ls, D33, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs)) ∧ ( gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last ∨ gstepf(gs, ls, D33, a).qrl ≠ [] ∧ gstepf(gs, ls, D33, a).vtail = ( gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl.butlast ).last ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D33, a).vs [(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl ).last ] .next = null)) ∧ ( gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ gstepf(gs, ls, D33, a).pretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ lstepf(gs, ls, D33, a).rvref ∈ gstepf(gs, ls, D33, a).vrvHp ∧ lstepf(gs, ls, D33, a).rvref ≠ null) ∧ nextnottid (lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noid (lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noowns(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 555 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D33, a) ∧ pcstepf(gs, ls, D33, a) = D6 → ( ( lstepf(gs, ls, D33, a).success → lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).vrvHp[lstepf(gs, ls, D33, a).rvref] ∧ lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).prvHp[lstepf(gs, ls, D33, a).rvref]) ∧ gstepf(gs, ls, D33, a).rvowns(gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid)) = (lstepf(gs, ls, D33, a).optval = Empty ∨ ¬ lstepf(gs, ls, D33, a).success ⊃ Pending(lstepf(gs, ls, D33, a).tid) ;Claimed(lstepf(gs, ls, D33, a).tid, lstepf(gs, ls, D33, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).ps, gstepf(gs, ls, D33, a).owns) ∧ ¬ dups(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).ps) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).vs) ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).ps) ∧ gstepf(gs, ls, D33, a).orl ≠ [] ∧ gstepf(gs, ls, D33, a).phead ∈ gstepf(gs, ls, D33, a).orl ∧ rvownerok(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp) ∧ dom gstepf(gs, ls, D33, a).vrvHp = dom gstepf(gs, ls, D33, a).prvHp ∧ ( gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ≠ null ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs(gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid, gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D33, a).orl.last = gstepf(gs, ls, D33, a).vhead ∧ (gstepf(gs, ls, D33, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D33, a).qrl.tail, gstepf(gs, ls, D33, a).vs)) ∨ gstepf(gs, ls, D33, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D33, a).orl.butlast.last = gstepf(gs, ls, D33, a).vhead ∧ gstepf(gs, ls, D33, a).phead ≠ gstepf(gs, ls, D33, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs)) ∧ ( gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last ∨ gstepf(gs, ls, D33, a).qrl ≠ [] ∧ gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl.butlast).last ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D33, a).vs[(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ gstepf(gs, ls, D33, a).pretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ lstepf(gs, ls, D33, a).rvref ∈ gstepf(gs, ls, D33, a).vrvHp ∧ lstepf(gs, ls, D33, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noid (lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noowns(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).owns)

Lemma step-D33-D6

Proof step 556 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D33), pre(gs, ls, D33, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D33, a) ∧ pcstepf(gs, ls, D33, a) = D6 → ( ( lstepf(gs, ls, D33, a).success → lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).vrvHp[lstepf(gs, ls, D33, a).rvref] ∧ lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).prvHp[lstepf(gs, ls, D33, a).rvref]) ∧ gstepf(gs, ls, D33, a).rvowns(gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid)) = (lstepf(gs, ls, D33, a).optval = Empty ∨ ¬ lstepf(gs, ls, D33, a).success ⊃ Pending(lstepf(gs, ls, D33, a).tid) ;Claimed(lstepf(gs, ls, D33, a).tid, lstepf(gs, ls, D33, a).optval.val) )) ∧ ( listp (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).ps, gstepf(gs, ls, D33, a).owns) ∧ ¬ dups(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).ps) ∧ markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).vs) ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).ps) ∧ gstepf(gs, ls, D33, a).orl ≠ [] ∧ gstepf(gs, ls, D33, a).phead ∈ gstepf(gs, ls, D33, a).orl ∧ rvownerok(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp, gstepf(gs, ls, D33, a).rvowns) ∧ allocrv(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp) ∧ dom gstepf(gs, ls, D33, a).vrvHp = dom gstepf(gs, ls, D33, a).prvHp ∧ ( gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ≠ null ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs(gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid, gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D33, a).orl.last = gstepf(gs, ls, D33, a).vhead ∧ (gstepf(gs, ls, D33, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D33, a).qrl.tail, gstepf(gs, ls, D33, a).vs)) ∨ gstepf(gs, ls, D33, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D33, a).orl.butlast.last = gstepf(gs, ls, D33, a).vhead ∧ gstepf(gs, ls, D33, a).phead ≠ gstepf(gs, ls, D33, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs)) ∧ ( gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last ∨ gstepf(gs, ls, D33, a).qrl ≠ [] ∧ gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl.butlast).last ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D33, a).vs[(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last].next = null)) ∧ ( gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ gstepf(gs, ls, D33, a).pretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref ∧ lstepf(gs, ls, D33, a).rvref ∈ gstepf(gs, ls, D33, a).vrvHp ∧ lstepf(gs, ls, D33, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs) ∧ noowns(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 557 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, DMSQGInv(gs), DMSQLInv(gs, ls, D33), pre(gs, ls, D33, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D33, a) ∧ pcstepf(gs, ls, D33, a) = D6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 558 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 559 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, gs.orl ≠ [], DMSQLInv(gs, ls, D33), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D33, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D33, a) ∧ pcstepf(gs, ls, D33, a) = D6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D33], <all paths>

Additional information

Used simplifier rules: ⊦ D33 ≠ crashed; (s) ⊦ D33 ≠ idle; (s) ⊦ D33 ≠ ready; (s) ⊦ D33 ≠ E1; (s) ⊦ D33 ≠ E17; (s) ⊦ D1 ≠ D33; (s) ⊦ D2 ≠ D33; (s) ⊦ D7 ≠ D33; (s) ⊦ D32 ≠ D33; (s) ⊦ D33 ≠ E4; (s) ⊦ D33 ≠ E16; (s) ⊦ D33 ≠ E15; (s) ⊦ D33 ≠ E14; (s) ⊦ D33 ≠ E13; (s) ⊦ D33 ≠ E12; (s) ⊦ D33 ≠ E11; (s) ⊦ D33 ≠ E10; (s) ⊦ D33 ≠ E9; (s) ⊦ D33 ≠ E8; (s) ⊦ D33 ≠ E7; (s) ⊦ D33 ≠ E6; (s) ⊦ D33 ≠ E5; (s) ⊦ D33 ≠ E3; (s) ⊦ D33 ≠ E2; (s) ⊦ D33 ≠ D34; (s) ⊦ D31 ≠ D33; (s) ⊦ D30 ≠ D33; (s) ⊦ D29 ≠ D33; (s) ⊦ D28 ≠ D33; (s) ⊦ D27 ≠ D33; (s) ⊦ D26 ≠ D33; (s) ⊦ D25 ≠ D33; (s) ⊦ D24 ≠ D33; (s) ⊦ D23 ≠ D33; (s) ⊦ D22 ≠ D33; (s) ⊦ D21 ≠ D33; (s) ⊦ D20 ≠ D33; (s) ⊦ D19 ≠ D33; (s) ⊦ D18 ≠ D33; (s) ⊦ D17 ≠ D33; (s) ⊦ D16 ≠ D33; (s) ⊦ D15 ≠ D33; (s) ⊦ D14 ≠ D33; (s) ⊦ D13 ≠ D33; (s) ⊦ D12 ≠ D33; (s) ⊦ D11 ≠ D33; (s) ⊦ D10 ≠ D33; (s) ⊦ D9 ≠ D33; (s) ⊦ D8 ≠ D33; (s) ⊦ D6 ≠ D33; (s) ⊦ D5 ≠ D33; (s) ⊦ D4 ≠ D33; (s) ⊦ D3 ≠ D33; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D33, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, D33, a) = D6; (s) Used terms: gs, ls, D33

Proof step 560 from proof copied-step-DMSQLInv (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 561 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D33, a).pretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref, gstepf(gs, ls, D33, a).rvowns(gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid)) = (lstepf(gs, ls, D33, a).optval = Empty ∨ ¬ lstepf(gs, ls, D33, a).success ⊃ Pending(lstepf(gs, ls, D33, a).tid) ;Claimed(lstepf(gs, ls, D33, a).tid, lstepf(gs, ls, D33, a).optval.val) ), gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref, dom gstepf(gs, ls, D33, a).vrvHp = dom gstepf(gs, ls, D33, a).prvHp, gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, gstepf(gs, ls, D33, a).orl ≠ [], lstepf(gs, ls, D33, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D33), allocrv(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp), allocrv(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp), listp(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).ps, gstepf(gs, ls, D33, a).owns), markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).ps), markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).vs), nextnottid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs), noid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs), nonullRetRefs (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).pretRefs), noowns(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).owns), pre(gs, ls, D33, a), rvownerok(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).rvowns), rvownerok(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp, gstepf(gs, ls, D33, a).rvowns), unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).ps), gstepf(gs, ls, D33, a).phead ∈ gstepf(gs, ls, D33, a).orl, lstepf(gs, ls, D33, a).rvref ∈ gstepf(gs, ls, D33, a).vrvHp, ¬ dups(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl), lstepf(gs, ls, D33, a).success → lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).vrvHp[lstepf(gs, ls, D33, a).rvref] ∧ lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).prvHp[lstepf(gs, ls, D33, a).rvref], gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ≠ null ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs(gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid, gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].val), gstepf(gs, ls, D33, a).orl.last = gstepf(gs, ls, D33, a).vhead ∧ (gstepf(gs, ls, D33, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D33, a).qrl.tail, gstepf(gs, ls, D33, a).vs)) ∨ gstepf(gs, ls, D33, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D33, a).orl.butlast.last = gstepf(gs, ls, D33, a).vhead ∧ gstepf(gs, ls, D33, a).phead ≠ gstepf(gs, ls, D33, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs), gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last ∨ gstepf(gs, ls, D33, a).qrl ≠ [] ∧ gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl.butlast).last ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D33, a).vs[(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 562 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 563 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, D33, a).pretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref, gstepf(gs, ls, D33, a).rvowns(gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid)) = (lstepf(gs, ls, D33, a).optval = Empty ∨ ¬ lstepf(gs, ls, D33, a).success ⊃ Pending(lstepf(gs, ls, D33, a).tid) ;Claimed(lstepf(gs, ls, D33, a).tid, lstepf(gs, ls, D33, a).optval.val) ), gstepf(gs, ls, D33, a).vretRefs(lstepf(gs, ls, D33, a).tid) = lstepf(gs, ls, D33, a).rvref, dom gstepf(gs, ls, D33, a).vrvHp = dom gstepf(gs, ls, D33, a).prvHp, gs0 = gstepf(gs, ls, D33, a), ls0 = lstepf(gs, ls, D33, a), pc0 = D6, gstepf(gs, ls, D33, a).orl ≠ [], lstepf(gs, ls, D33, a).rvref ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, D33), allocrv(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp), allocrv(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp), listp(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).ps, gstepf(gs, ls, D33, a).owns), markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).vs), markedp(gstepf(gs, ls, D33, a).orl, gstepf(gs, ls, D33, a).ps), nextnottid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs), noid(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vhead, gstepf(gs, ls, D33, a).vs), nonullRetRefs (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs, gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).pretRefs), noowns(lstepf(gs, ls, D33, a).tid, gstepf(gs, ls, D33, a).owns), pre(gs, ls, D33, a), rvownerok(gstepf(gs, ls, D33, a).pretRefs, gstepf(gs, ls, D33, a).prvHp, gstepf(gs, ls, D33, a).rvowns), rvownerok(gstepf(gs, ls, D33, a).vretRefs, gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).rvowns), unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).ps), lstepf(gs, ls, D33, a).rvref ∈ gstepf(gs, ls, D33, a).vrvHp, gstepf(gs, ls, D33, a).phead ∈ gstepf(gs, ls, D33, a).orl, ¬ dups(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl), gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next ≠ null ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D33, a).rvowns (gstepf(gs, ls, D33, a).vretRefs(gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].deqID.tid, gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).vhead].next].val), lstepf(gs, ls, D33, a).success → lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).vrvHp[lstepf(gs, ls, D33, a).rvref] ∧ lstepf(gs, ls, D33, a).optval = gstepf(gs, ls, D33, a).prvHp[lstepf(gs, ls, D33, a).rvref], gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last ∨ gstepf(gs, ls, D33, a).qrl ≠ [] ∧ gstepf(gs, ls, D33, a).vtail = (gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl.butlast).last ∧ gstepf(gs, ls, D33, a).vs[gstepf(gs, ls, D33, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D33, a).vs[(gstepf(gs, ls, D33, a).orl + gstepf(gs, ls, D33, a).qrl).last].next = null, gstepf(gs, ls, D33, a).orl.last = gstepf(gs, ls, D33, a).vhead ∧ (gstepf(gs, ls, D33, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D33, a).qrl.tail, gstepf(gs, ls, D33, a).vs)) ∨ gstepf(gs, ls, D33, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D33, a).orl.butlast.last = gstepf(gs, ls, D33, a).vhead ∧ gstepf(gs, ls, D33, a).phead ≠ gstepf(gs, ls, D33, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D33, a).qrl, gstepf(gs, ls, D33, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D33, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D6 ≠ D34; (s) ⊦ D6 ≠ D7; (s) ⊦ D6 ≠ D16; (s) ⊦ D6 ≠ D17; (s) ⊦ D6 ≠ D31; (s) ⊦ D6 ≠ D32; (s) ⊦ D6 ≠ D33; (s) ⊦ D6 ≠ D25; (s) ⊦ D6 ≠ D26; (s) ⊦ D6 ≠ D27; (s) ⊦ D6 ≠ D28; (s) ⊦ D6 ≠ D29; (s) ⊦ D6 ≠ D30; (s) ⊦ D6 ≠ D20; (s) ⊦ D6 ≠ D21; (s) ⊦ D6 ≠ E1; (s) ⊦ D6 ≠ E12; (s) ⊦ D6 ≠ E17; (s) ⊦ D6 ≠ D8; (s) ⊦ D6 ≠ D9; (s) ⊦ D6 ≠ D10; (s) ⊦ D6 ≠ D11; (s) ⊦ D6 ≠ D12; (s) ⊦ D6 ≠ D13; (s) ⊦ D6 ≠ D14; (s) ⊦ D6 ≠ D15; (s) ⊦ D6 ≠ D18; (s) ⊦ D6 ≠ D19; (s) ⊦ D6 ≠ D22; (s) ⊦ D6 ≠ D23; (s) ⊦ D6 ≠ D24; (s) ⊦ D6 ≠ crashed; (s) ⊦ D6 ≠ idle; (s) ⊦ D6 ≠ ready; (s) ⊦ D1 ≠ D6; (s) ⊦ D2 ≠ D6; (s) ⊦ D3 ≠ D6; (s) ⊦ D4 ≠ D6; (s) ⊦ D5 ≠ D6; (s) ⊦ D6 ≠ E2; (s) ⊦ D6 ≠ E3; (s) ⊦ D6 ≠ E5; (s) ⊦ D6 ≠ E6; (s) ⊦ D6 ≠ E7; (s) ⊦ D6 ≠ E8; (s) ⊦ D6 ≠ E9; (s) ⊦ D6 ≠ E13; (s) ⊦ D6 ≠ E14; (s) ⊦ D6 ≠ E15; (s) ⊦ D6 ≠ E16; (s) ⊦ D6 ≠ E10; (s) ⊦ D6 ≠ E11; (s) ⊦ D6 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D33, τ) = gs; (s) ⊦ lstepf(gs, ls, D33, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 564 from proof copied-step-DMSQLInv (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 565 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = D34, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 566 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = pcstepf(gs, ls, D34, a), DMSQGInv(gs), DMSQLInv(gs, ls, D34), pre(gs, ls, D34, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-D34, seq: ⊦ pcstepf(gs, ls, D34, a) = ready, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 567 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, D34, a) = ready

A spec-lemma

Proof step 568 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, D34), pre(gs, ls, D34, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-D34-ready, seq:⊦ ( ( 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) )) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D34, a) ∧ pcstepf(gs, ls, D34, a) = ready → ( listp (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).ps, gstepf(gs, ls, D34, a).owns) ∧ ¬ dups(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).ps) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).vs) ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).ps) ∧ gstepf(gs, ls, D34, a).orl ≠ [] ∧ gstepf(gs, ls, D34, a).phead ∈ gstepf(gs, ls, D34, a).orl ∧ rvownerok (gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv (gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv (gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp) ∧ dom gstepf(gs, ls, D34, a).vrvHp = dom gstepf(gs, ls, D34, a).prvHp ∧ ( gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ≠ null ∧ gstepf(gs, ls, D34, a).vs [gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, D34, a).rvowns (gstepf(gs, ls, D34, a).vretRefs (gstepf(gs, ls, D34, a).vs [gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, D34, a).vs [gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ] .deqID .tid, gstepf(gs, ls, D34, a).vs [gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, D34, a).orl.last = gstepf(gs, ls, D34, a).vhead ∧ ( gstepf(gs, ls, D34, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, D34, a).qrl.tail, gstepf(gs, ls, D34, a).vs)) ∨ gstepf(gs, ls, D34, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D34, a).orl.butlast.last = gstepf(gs, ls, D34, a).vhead ∧ gstepf(gs, ls, D34, a).phead ≠ gstepf(gs, ls, D34, a).orl.last ∧ unmarkedp (gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs)) ∧ ( gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last ∨ gstepf(gs, ls, D34, a).qrl ≠ [] ∧ gstepf(gs, ls, D34, a).vtail = ( gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl.butlast ).last ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, D34, a).vs [(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noid (lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noowns(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 569 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D34, a) ∧ pcstepf(gs, ls, D34, a) = ready → ( listp (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).ps, gstepf(gs, ls, D34, a).owns) ∧ ¬ dups(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).ps) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).vs) ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).ps) ∧ gstepf(gs, ls, D34, a).orl ≠ [] ∧ gstepf(gs, ls, D34, a).phead ∈ gstepf(gs, ls, D34, a).orl ∧ rvownerok(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp) ∧ dom gstepf(gs, ls, D34, a).vrvHp = dom gstepf(gs, ls, D34, a).prvHp ∧ ( gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ≠ null ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D34, a).rvowns (gstepf(gs, ls, D34, a).vretRefs(gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid, gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D34, a).orl.last = gstepf(gs, ls, D34, a).vhead ∧ (gstepf(gs, ls, D34, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D34, a).qrl.tail, gstepf(gs, ls, D34, a).vs)) ∨ gstepf(gs, ls, D34, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D34, a).orl.butlast.last = gstepf(gs, ls, D34, a).vhead ∧ gstepf(gs, ls, D34, a).phead ≠ gstepf(gs, ls, D34, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs)) ∧ ( gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last ∨ gstepf(gs, ls, D34, a).qrl ≠ [] ∧ gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl.butlast).last ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D34, a).vs[(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noid (lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noowns(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).owns)

Lemma step-D34-ready

Proof step 570 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, D34), pre(gs, ls, D34, a), ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D34, a) ∧ pcstepf(gs, ls, D34, a) = ready → ( listp (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).ps, gstepf(gs, ls, D34, a).owns) ∧ ¬ dups(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).ps) ∧ markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).vs) ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).ps) ∧ gstepf(gs, ls, D34, a).orl ≠ [] ∧ gstepf(gs, ls, D34, a).phead ∈ gstepf(gs, ls, D34, a).orl ∧ rvownerok(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp, gstepf(gs, ls, D34, a).rvowns) ∧ allocrv(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp) ∧ dom gstepf(gs, ls, D34, a).vrvHp = dom gstepf(gs, ls, D34, a).prvHp ∧ ( gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ≠ null ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D34, a).rvowns (gstepf(gs, ls, D34, a).vretRefs(gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid, gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D34, a).orl.last = gstepf(gs, ls, D34, a).vhead ∧ (gstepf(gs, ls, D34, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D34, a).qrl.tail, gstepf(gs, ls, D34, a).vs)) ∨ gstepf(gs, ls, D34, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D34, a).orl.butlast.last = gstepf(gs, ls, D34, a).vhead ∧ gstepf(gs, ls, D34, a).phead ≠ gstepf(gs, ls, D34, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs)) ∧ ( gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last ∨ gstepf(gs, ls, D34, a).qrl ≠ [] ∧ gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl.butlast).last ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D34, a).vs[(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs) ∧ noowns(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 571 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, D34), pre(gs, ls, D34, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D34, a) ∧ pcstepf(gs, ls, D34, a) = ready

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 572 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 573 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, gs.orl ≠ [], DMSQLInv(gs, ls, D34), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, D34, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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))) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D34, a) ∧ pcstepf(gs, ls, D34, a) = ready, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, D34], <all paths>

Additional information

Used simplifier rules: ⊦ D34 ≠ crashed; (s) ⊦ D34 ≠ idle; (s) ⊦ D34 ≠ ready; (s) ⊦ D34 ≠ E1; (s) ⊦ D34 ≠ E17; (s) ⊦ D1 ≠ D34; (s) ⊦ D2 ≠ D34; (s) ⊦ D7 ≠ D34; (s) ⊦ D32 ≠ D34; (s) ⊦ D33 ≠ D34; (s) ⊦ D34 ≠ E4; (s) ⊦ D34 ≠ E16; (s) ⊦ D34 ≠ E15; (s) ⊦ D34 ≠ E14; (s) ⊦ D34 ≠ E13; (s) ⊦ D34 ≠ E12; (s) ⊦ D34 ≠ E11; (s) ⊦ D34 ≠ E10; (s) ⊦ D34 ≠ E9; (s) ⊦ D34 ≠ E8; (s) ⊦ D34 ≠ E7; (s) ⊦ D34 ≠ E6; (s) ⊦ D34 ≠ E5; (s) ⊦ D34 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D31 ≠ D34; (s) ⊦ D30 ≠ D34; (s) ⊦ D29 ≠ D34; (s) ⊦ D28 ≠ D34; (s) ⊦ D27 ≠ D34; (s) ⊦ D26 ≠ D34; (s) ⊦ D25 ≠ D34; (s) ⊦ D24 ≠ D34; (s) ⊦ D23 ≠ D34; (s) ⊦ D22 ≠ D34; (s) ⊦ D21 ≠ D34; (s) ⊦ D20 ≠ D34; (s) ⊦ D19 ≠ D34; (s) ⊦ D18 ≠ D34; (s) ⊦ D17 ≠ D34; (s) ⊦ D16 ≠ D34; (s) ⊦ D15 ≠ D34; (s) ⊦ D14 ≠ D34; (s) ⊦ D13 ≠ D34; (s) ⊦ D12 ≠ D34; (s) ⊦ D11 ≠ D34; (s) ⊦ D10 ≠ D34; (s) ⊦ D9 ≠ D34; (s) ⊦ D8 ≠ D34; (s) ⊦ D6 ≠ D34; (s) ⊦ D5 ≠ D34; (s) ⊦ D4 ≠ D34; (s) ⊦ D3 ≠ D34; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ pcstepf(gs, ls, D34, a) = ready; (s) Used terms: gs, ls, D34

Proof step 574 from proof copied-step-DMSQLInv (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 575 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, D34, a).vrvHp = dom gstepf(gs, ls, D34, a).prvHp, gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, gstepf(gs, ls, D34, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D34), allocrv(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp), allocrv(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp), listp(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).ps, gstepf(gs, ls, D34, a).owns), markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).ps), markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).vs), nextnottid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs), noid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs), nonullRetRefs (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).pretRefs), noowns(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).owns), pre(gs, ls, D34, a), rvownerok(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp, gstepf(gs, ls, D34, a).rvowns), rvownerok(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp, gstepf(gs, ls, D34, a).rvowns), unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).ps), gstepf(gs, ls, D34, a).phead ∈ gstepf(gs, ls, D34, a).orl, ¬ dups(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl), gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ≠ null ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D34, a).rvowns (gstepf(gs, ls, D34, a).vretRefs(gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid, gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].val), gstepf(gs, ls, D34, a).orl.last = gstepf(gs, ls, D34, a).vhead ∧ (gstepf(gs, ls, D34, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D34, a).qrl.tail, gstepf(gs, ls, D34, a).vs)) ∨ gstepf(gs, ls, D34, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D34, a).orl.butlast.last = gstepf(gs, ls, D34, a).vhead ∧ gstepf(gs, ls, D34, a).phead ≠ gstepf(gs, ls, D34, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs), gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last ∨ gstepf(gs, ls, D34, a).qrl ≠ [] ∧ gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl.butlast).last ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D34, a).vs[(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 576 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 577 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, D34, a).vrvHp = dom gstepf(gs, ls, D34, a).prvHp, gs0 = gstepf(gs, ls, D34, a), ls0 = lstepf(gs, ls, D34, a), pc0 = ready, gstepf(gs, ls, D34, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, D34), allocrv(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp), allocrv(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp), listp(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).ps, gstepf(gs, ls, D34, a).owns), markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).vs), markedp(gstepf(gs, ls, D34, a).orl, gstepf(gs, ls, D34, a).ps), nextnottid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs), noid(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vhead, gstepf(gs, ls, D34, a).vs), nonullRetRefs (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs, gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).pretRefs), noowns(lstepf(gs, ls, D34, a).tid, gstepf(gs, ls, D34, a).owns), pre(gs, ls, D34, a), rvownerok(gstepf(gs, ls, D34, a).pretRefs, gstepf(gs, ls, D34, a).prvHp, gstepf(gs, ls, D34, a).rvowns), rvownerok(gstepf(gs, ls, D34, a).vretRefs, gstepf(gs, ls, D34, a).vrvHp, gstepf(gs, ls, D34, a).rvowns), unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).ps), gstepf(gs, ls, D34, a).phead ∈ gstepf(gs, ls, D34, a).orl, ¬ dups(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl), gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next ≠ null ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D34, a).rvowns (gstepf(gs, ls, D34, a).vretRefs(gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].deqID.tid, gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).vhead].next].val), gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last ∨ gstepf(gs, ls, D34, a).qrl ≠ [] ∧ gstepf(gs, ls, D34, a).vtail = (gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl.butlast).last ∧ gstepf(gs, ls, D34, a).vs[gstepf(gs, ls, D34, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D34, a).vs[(gstepf(gs, ls, D34, a).orl + gstepf(gs, ls, D34, a).qrl).last].next = null, gstepf(gs, ls, D34, a).orl.last = gstepf(gs, ls, D34, a).vhead ∧ (gstepf(gs, ls, D34, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D34, a).qrl.tail, gstepf(gs, ls, D34, a).vs)) ∨ gstepf(gs, ls, D34, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D34, a).orl.butlast.last = gstepf(gs, ls, D34, a).vhead ∧ gstepf(gs, ls, D34, a).phead ≠ gstepf(gs, ls, D34, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D34, a).qrl, gstepf(gs, ls, D34, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, D34, a) ↔ a = retDEQ(ls.tid, ls.optval); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D3 ≠ ready; (s) ⊦ D4 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ E12 ≠ ready; (s) ⊦ D5 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D7 ≠ ready; (s) ⊦ D16 ≠ ready; (s) ⊦ D17 ≠ ready; (s) ⊦ D25 ≠ ready; (s) ⊦ D26 ≠ ready; (s) ⊦ D31 ≠ ready; (s) ⊦ D32 ≠ ready; (s) ⊦ D33 ≠ ready; (s) ⊦ D27 ≠ ready; (s) ⊦ D28 ≠ ready; (s) ⊦ D29 ≠ ready; (s) ⊦ D30 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D8 ≠ ready; (s) ⊦ D9 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D18 ≠ ready; (s) ⊦ D19 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ crashed ≠ ready; (s) ⊦ idle ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ E4 ≠ ready; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, D34, retDEQ(ls.tid, optval)) = gs; (s) ⊦ lstepf(gs, ls, D34, retDEQ(ls.tid, ls.optval)) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 578 from proof copied-step-DMSQLInv (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 579 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E1, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 580 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = pcstepf(gs, ls, E1, a), DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E1, seq:⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 581 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1)

A spec-lemma

Proof step 582 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), pc0 = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 583 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E2, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E1-E2, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → gstepf(gs, ls, E1, a).owns(lstepf(gs, ls, E1, a).node) = Some(lstepf(gs, ls, E1, a).tid) ∧ ( listp (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok (gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv (gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv (gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs (gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ ( gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = ( gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast ).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E1, a).vs [(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).ps ∧ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).vs ∧ lstepf(gs, ls, E1, a).node ≠ null ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).orl ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).qrl) ∧ ¬ lstepf(gs, ls, E1, a).success ∧ nextnottid (lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid (lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ oneowns (lstepf(gs, ls, E1, a).tid, lstepf(gs, ls, E1, a).node, gstepf(gs, ls, E1, a).owns, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 584 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → gstepf(gs, ls, E1, a).owns(lstepf(gs, ls, E1, a).node) = Some(lstepf(gs, ls, E1, a).tid) ∧ ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).ps ∧ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).vs ∧ lstepf(gs, ls, E1, a).node ≠ null ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).orl ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).qrl) ∧ ¬ lstepf(gs, ls, E1, a).success ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ oneowns(lstepf(gs, ls, E1, a).tid, lstepf(gs, ls, E1, a).node, gstepf(gs, ls, E1, a).owns, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps)

Lemma step-E1-E2

Proof step 585 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E2, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → gstepf(gs, ls, E1, a).owns(lstepf(gs, ls, E1, a).node) = Some(lstepf(gs, ls, E1, a).tid) ∧ ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).ps ∧ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).vs ∧ lstepf(gs, ls, E1, a).node ≠ null ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).orl ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).qrl) ∧ ¬ lstepf(gs, ls, E1, a).success ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ oneowns(lstepf(gs, ls, E1, a).tid, lstepf(gs, ls, E1, a).node, gstepf(gs, ls, E1, a).owns, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps), ∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 586 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E2, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E2 → gstepf(gs, ls, E1, a).owns(lstepf(gs, ls, E1, a).node) = Some(lstepf(gs, ls, E1, a).tid) ∧ ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).ps ∧ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).vs ∧ lstepf(gs, ls, E1, a).node ≠ null ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).orl ∧ ¬ lstepf(gs, ls, E1, a).node ∈ gstepf(gs, ls, E1, a).qrl) ∧ ¬ lstepf(gs, ls, E1, a).success ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ oneowns(lstepf(gs, ls, E1, a).tid, lstepf(gs, ls, E1, a).node, gstepf(gs, ls, E1, a).owns, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 587 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, chooseE1(node0, nd0, success0)), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, chooseE1(node0, nd0, success0)) ∧ pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = E2 → gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns(lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node) = Some(lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid) ∧ ( listp (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns) ∧ ¬ dups(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl) ∧ markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps) ∧ markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps) ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ∧ rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns) ∧ allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs) ∧ rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns) ∧ allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp) ∧ dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp = dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ≠ null ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.tail, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs)) ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ≠ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs)) ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.butlast).last ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ] .next = null)) ∧ ( lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps ∧ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs ∧ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ≠ null ∧ ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ∧ ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl) ∧ ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).success ∧ nextnottid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ noid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ oneowns (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 588 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, chooseE1(node0, nd0, success0)) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, chooseE1(node0, nd0, success0)) ∧ pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = E2

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] → [gs, ls, E1], <all paths>

Additional information

Used terms: gs, ls, E1

Proof step 589 from proof copied-step-DMSQLInv (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 590 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, DMSQGInv(gs), pre(gs, ls, E1, chooseE1(node0, nd0, success0)), E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = 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, E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = 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)), E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = 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), E1 = 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), E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = 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) ), E1 = 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), E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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], E1 = 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], E1 = 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)), E1 = 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)), E1 = 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)), E1 = 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), E1 = 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), E1 = 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), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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)), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = 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, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = 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, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E4 ∨ E1 = 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], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = 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), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = 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) ), E1 = 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)), E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, chooseE1(node0, nd0, success0)) ∧ pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = E2, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 591 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 592 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E1, chooseE1(node0, nd0, success0)), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), E1 = 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)), E1 = 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) ), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = 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), E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E4 ∨ E1 = 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], E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = 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, E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = 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, E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = 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)), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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), E1 = 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), E1 = 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), E1 = 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)), E1 = 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)), E1 = 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)), E1 = 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], E1 = 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], E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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), E1 = 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) ), E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = 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), E1 = 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), E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = 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)), E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = 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, E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, chooseE1(node0, nd0, success0)) ∧ pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = E2

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 2

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ chooseE1(node, nd, success) = chooseE1(node0, nd0, success0) ↔ node = node0 ∧ nd = nd0 ∧ (success ↔ success0); (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ E1 ≠ E4; (s) ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ E10; (s) ⊦ E1 ≠ E2; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E5; (s) ⊦ E1 ≠ E6; (s) ⊦ E1 ≠ E7; (s) ⊦ E1 ≠ E8; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E13; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E16; (s) ⊦ E1 ≠ crashed; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ ready; (s) ⊦ D1 ≠ E1; (s) ⊦ D2 ≠ E1; (s) ⊦ D3 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D14 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D33 ≠ E1; (s) ⊦ D34 ≠ E1; (s) ⊦ E1 ≠ E12; (s)

Proof step 593 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, gs.orl ≠ [], pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) ≠ E2, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E1, chooseE1(node0, nd0, success0)), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), E1 = D3 → gs.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ∈ gs.prvHp ∧ ls.rvref ≠ null, E1 = 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, E1 = D5 → gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = 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)), E1 = D8 → gs.vtail ∈ gs.orl + gs.qrl from ls.first, E1 = D9 → gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = 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), E1 = 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), E1 = D12 → ls.lst ∈ gs.orl + gs.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs.vs[ls.lst].next), E1 = D13 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = null, E1 = D14 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null, E1 = D15 → ls.lst ∈ gs.orl + gs.qrl ∧ gs.vrvHp[ls.rvref] = Empty ∧ gs.prvHp[ls.rvref] = Empty, E1 = D16 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D17 → ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = D18 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = D19 → ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = 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) ), E1 = 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), E1 = D22 → gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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], E1 = 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], E1 = 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)), E1 = 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)), E1 = 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)), E1 = 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), E1 = 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), E1 = 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), E1 = D31 → ls.first ∈ gs.orl ∧ gs.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next, E1 = 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)), E1 = E2 → gs.owns(ls.node) = Some(ls.tid), E1 = E3 → gs.owns(ls.node) = Some(ls.tid), E1 = E5 → gs.owns(ls.node) = Some(ls.tid), E1 = E6 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail), E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = 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), E1 = 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, E1 = E13 → gs.owns(ls.node) = Some(ls.tid), E1 = E14 → gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null, E1 = 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, E1 = E16 → gs.owns(ls.node) = Some(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl, E1 = E4 ∨ E1 = 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], E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.vs[ls.node] = mk(ls.value, None, null), E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → gs.ps[ls.node] = gs.vs[ls.node], E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = D13 ∨ E1 = D14 ∨ E1 = D15 → ¬ ls.success ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → ¬ ls.success, E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 → ls.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first, E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst, E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 → ls.lst ∈ gs.orl + gs.qrl from ls.first, E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 → gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null, E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = 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), E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 → ls.addr ∈ gs.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs.vs[ls.nxt].val), E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = E1 ∨ E1 = E2 ∨ E1 = E3 ∨ E1 = E4 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E10 ∨ E1 = E11 ∨ E1 = E12 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 ∨ E1 = E17 ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 → noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D18 ∨ E1 = D19 → noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), E1 = D22 ∨ E1 = D23 ∨ E1 = D24 → noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs), E1 = crashed ∨ E1 = idle ∨ E1 = ready ∨ E1 = D1 ∨ E1 = D2 ∨ E1 = D3 ∨ E1 = D4 ∨ E1 = D5 ∨ E1 = D6 ∨ E1 = D7 ∨ E1 = D8 ∨ E1 = D9 ∨ E1 = D10 ∨ E1 = D11 ∨ E1 = D12 ∨ E1 = D13 ∨ E1 = D14 ∨ E1 = D15 ∨ E1 = D16 ∨ E1 = D17 ∨ E1 = D18 ∨ E1 = D19 ∨ E1 = D20 ∨ E1 = D21 ∨ E1 = D22 ∨ E1 = D23 ∨ E1 = D24 ∨ E1 = D25 ∨ E1 = D26 ∨ E1 = D27 ∨ E1 = D28 ∨ E1 = D29 ∨ E1 = D30 ∨ E1 = D31 ∨ E1 = D32 ∨ E1 = D33 ∨ E1 = D34 ∨ E1 = E1 ∨ E1 = E12 ∨ E1 = E17 → noowns(ls.tid, gs.owns), E1 = E2 ∨ E1 = E3 ∨ E1 = E5 ∨ E1 = E6 ∨ E1 = E7 ∨ E1 = E8 ∨ E1 = E9 ∨ E1 = E13 ∨ E1 = E14 ∨ E1 = E15 ∨ E1 = E16 → oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), E1 = 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) ), E1 = 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)), E1 = E4 → (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ((ls.node:= node0).nd:= nd0).success:= success0; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ D3 ≠ E1; (s) ⊦ D4 ≠ E1; (s) ⊦ D5 ≠ E1; (s) ⊦ D6 ≠ E1; (s) ⊦ D8 ≠ E1; (s) ⊦ D9 ≠ E1; (s) ⊦ D10 ≠ E1; (s) ⊦ D11 ≠ E1; (s) ⊦ D12 ≠ E1; (s) ⊦ D13 ≠ E1; (s) ⊦ D14 ≠ E1; (s) ⊦ D15 ≠ E1; (s) ⊦ D16 ≠ E1; (s) ⊦ D17 ≠ E1; (s) ⊦ D18 ≠ E1; (s) ⊦ D19 ≠ E1; (s) ⊦ D20 ≠ E1; (s) ⊦ D21 ≠ E1; (s) ⊦ D22 ≠ E1; (s) ⊦ D23 ≠ E1; (s) ⊦ D24 ≠ E1; (s) ⊦ D25 ≠ E1; (s) ⊦ D26 ≠ E1; (s) ⊦ D27 ≠ E1; (s) ⊦ D28 ≠ E1; (s) ⊦ D29 ≠ E1; (s) ⊦ D30 ≠ E1; (s) ⊦ D31 ≠ E1; (s) ⊦ D34 ≠ E1; (s) ⊦ E1 ≠ E2; (s) ⊦ E1 ≠ E3; (s) ⊦ E1 ≠ E5; (s) ⊦ E1 ≠ E6; (s) ⊦ E1 ≠ E7; (s) ⊦ E1 ≠ E8; (s) ⊦ E1 ≠ E9; (s) ⊦ E1 ≠ E10; (s) ⊦ E1 ≠ E11; (s) ⊦ E1 ≠ E12; (s) ⊦ E1 ≠ E13; (s) ⊦ E1 ≠ E14; (s) ⊦ E1 ≠ E15; (s) ⊦ E1 ≠ E16; (s) ⊦ E1 ≠ E4; (s) ⊦ D33 ≠ E1; (s) ⊦ D32 ≠ E1; (s) ⊦ D7 ≠ E1; (s) ⊦ E1 ≠ ready; (s) ⊦ E1 ≠ idle; (s) ⊦ E1 ≠ crashed; (s) ⊦ D2 ≠ E1; (s) ⊦ D1 ≠ E1; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ chooseE1(node, nd, success) = chooseE1(node0, nd0, success0) ↔ node = node0 ∧ nd = nd0 ∧ (success ↔ success0); (ws) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1); (s)

Proof step 594 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], node ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ node ∈ gs.vs, ¬ node ∈ gs.ps, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ∃ node1, nd, success. chooseE1(node, nd0, false) = chooseE1(node1, nd, success), DMSQGInv(((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]).owns:= gs.owns(node; Some(ls.tid))) ∧ DMSQLInv(((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]).owns:= gs.owns(node; Some(ls.tid)), ((ls.node:= node).nd:= nd0).success:= false, E2)

User applied rule exists right

And closed the goal!

Rule argument

pos: right 1 terms: node, nd0, false abort: F discard: T computed: T

Additional information

Used terms: node, nd0, false

Proof step 595 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns(lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node) = Some(lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid), dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp = dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp, gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E2, lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ≠ null, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E1), allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp), allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp), listp (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns), markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps), markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs), nextnottid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs), noid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs), nonullRetRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs), oneowns (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps), pre(gs, ls, E1, chooseE1(node0, nd0, success0)), rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns), rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns), unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps), gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps, lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).success, ¬ dups(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl), ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, ¬ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).node ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ≠ null ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .val), gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.tail, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs)) ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ≠ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs), gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.butlast).last ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ] .next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ((ls.node:= node0).nd:= nd0).success:= success0; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).nd = nd; (s) ⊦ (ls.success:= success).nd = ls.nd; (s) ⊦ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = ( ( gs .ps:= gs.ps [(((ls.node:= node0).nd:= nd0).success:= success0 ).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .vs:= gs.vs [(((ls.node:= node0).nd:= nd0).success:= success0).node, (((ls.node:= node0).nd:= nd0).success:= success0).nd ]) .owns:= gs.owns ((((ls.node:= node0).nd:= nd0).success:= success0).node ; Some((((ls.node:= node0).nd:= nd0).success:= success0).tid) ); (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.vs:= ps0).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.vs:= ps0).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.vs:= ps0).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.vs:= ps0).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ ¬ node ∈ rl → (markedp(rl, vs[node, nd]) ↔ markedp(rl, vs)); (s) ⊦ (ls.success:= success).success ↔ success; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.vs:= ps0).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ chooseE1(node, nd, success) = chooseE1(node0, nd0, success0) ↔ node = node0 ∧ nd = nd0 ∧ (success ↔ success0); (ws) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)); (s) ⊦ a ∈ st[a, d]; (s) ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s)

Proof step 596 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], node ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs[node, nd0], gs.ps[node, nd0], gs.owns(node; Some(ls.tid))), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs[node, nd0]), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs[node, nd0]), nonullRetRefs(gs.orl + gs.qrl, gs.vs[node, nd0], gs.vretRefs, gs.pretRefs), oneowns(ls.tid, node, gs.owns(node; Some(ls.tid)), gs.vs[node, nd0], gs.ps[node, nd0]), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs[node, nd0], gs.phead ∈ gs.ps[node, nd0], ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ node ∈ gs.orl, ¬ node ∈ gs.qrl, ¬ node ∈ gs.vs, ¬ node ∈ gs.ps, gs.vs[node, nd0][gs.vhead].next ≠ null ∧ gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid)) = Claimed(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid, gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs[node, nd0])) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[node, nd0][gs.qrl.last].deqID = None ∧ gs.vs[node, nd0][gs.qrl.last].next = null ⊦ DMSQGInv(((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]).owns:= gs.owns(node; Some(ls.tid))) ∧ DMSQLInv(((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]).owns:= gs.owns(node; Some(ls.tid)), ((ls.node:= node).nd:= nd0).success:= false, E2)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 597 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]) .owns:= gs.owns(node; Some(ls.tid))

Proof step 598 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 599 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 600 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 31

Additional information

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

Proof step 601 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 32

Additional information

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

Proof step 602 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], node ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs[node, nd0], gs.ps[node, nd0], gs.owns(node; Some(ls.tid))), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs[node, nd0]), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs[node, nd0]), nonullRetRefs(gs.orl + gs.qrl, gs.vs[node, nd0], gs.vretRefs, gs.pretRefs), oneowns(ls.tid, node, gs.owns(node; Some(ls.tid)), gs.vs[node, nd0], gs.ps[node, nd0]), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps[node, nd0], gs.phead ∈ gs.vs[node, nd0], gs.phead ∈ gs.orl, ¬ DMSQLInv(((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]).owns:= gs.owns(node; Some(ls.tid)), ((ls.node:= node).nd:= nd0).success:= false, E2), ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ node ∈ gs.orl, ¬ node ∈ gs.qrl, ¬ node ∈ gs.vs, ¬ node ∈ gs.ps, gs.vs[node, nd0][gs.vhead].next ≠ null ∧ gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid)) = Claimed(gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].deqID.tid, gs.vs[node, nd0][gs.vs[node, nd0][gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[node, nd0][gs.qrl.last].deqID = None ∧ gs.vs[node, nd0][gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs[node, nd0])) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦

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] → [ ((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]) .owns:= gs.owns(node; Some(ls.tid)), ((ls.node:= node).nd:= nd0).success:= false, E2], <all paths>

Additional information

Used simplifier rules: ⊦ Some(tid) = Some(tid0) ↔ tid = tid0; (s) ⊦ a ∈ st[a, d]; (s) ⊦ E2 ≠ E3; (s) ⊦ E2 ≠ E5; (s) ⊦ E2 ≠ E6; (s) ⊦ E2 ≠ E7; (s) ⊦ E2 ≠ E8; (s) ⊦ E2 ≠ E9; (s) ⊦ E2 ≠ E13; (s) ⊦ E2 ≠ E14; (s) ⊦ E2 ≠ E15; (s) ⊦ E2 ≠ E16; (s) ⊦ (ls.success:= success).success ↔ success; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.vs:= ps0).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).qrl = gs.qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.vs:= ps0).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ E2 ≠ crashed; (s) ⊦ E2 ≠ idle; (s) ⊦ E2 ≠ ready; (s) ⊦ D1 ≠ E2; (s) ⊦ D2 ≠ E2; (s) ⊦ D3 ≠ E2; (s) ⊦ D4 ≠ E2; (s) ⊦ D5 ≠ E2; (s) ⊦ D6 ≠ E2; (s) ⊦ D7 ≠ E2; (s) ⊦ D8 ≠ E2; (s) ⊦ D9 ≠ E2; (s) ⊦ D10 ≠ E2; (s) ⊦ D11 ≠ E2; (s) ⊦ D12 ≠ E2; (s) ⊦ D13 ≠ E2; (s) ⊦ D14 ≠ E2; (s) ⊦ D15 ≠ E2; (s) ⊦ D16 ≠ E2; (s) ⊦ D17 ≠ E2; (s) ⊦ D18 ≠ E2; (s) ⊦ D19 ≠ E2; (s) ⊦ D20 ≠ E2; (s) ⊦ D21 ≠ E2; (s) ⊦ D22 ≠ E2; (s) ⊦ D23 ≠ E2; (s) ⊦ D24 ≠ E2; (s) ⊦ D25 ≠ E2; (s) ⊦ D26 ≠ E2; (s) ⊦ D27 ≠ E2; (s) ⊦ D28 ≠ E2; (s) ⊦ D29 ≠ E2; (s) ⊦ D30 ≠ E2; (s) ⊦ D31 ≠ E2; (s) ⊦ D32 ≠ E2; (s) ⊦ D33 ≠ E2; (s) ⊦ D34 ≠ E2; (s) ⊦ E1 ≠ E2; (s) ⊦ E2 ≠ E12; (s) ⊦ E2 ≠ E17; (s) ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (ls.nd:= nd).tid = ls.tid; (s) ⊦ (ls.node:= node).tid = ls.tid; (s) ⊦ (ls.success:= success).node = ls.node; (s) ⊦ (ls.nd:= nd).node = ls.node; (s) ⊦ (ls.node:= node).node = node; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.vs:= ps0).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ E2 ≠ E10; (s) ⊦ E2 ≠ E11; (s) ⊦ E2 ≠ E4; (s) Used terms: ((gs.ps:= gs.ps[node, nd0]).vs:= gs.vs[node, nd0]) .owns:= gs.owns(node; Some(ls.tid)), ((ls.node:= node).nd:= nd0).success:= false, E2

Proof step 603 from proof copied-step-DMSQLInv (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 604 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E1, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ∀ node0, nd0, success0. a ≠ chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E1-E1, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok (gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv (gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv (gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs (gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E1, a).vs [gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ ( gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = ( gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast ).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E1, a).vs [(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid (lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 605 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns)

Lemma step-E1-E1

Proof step 606 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E1, DMSQGInv(gs), DMSQLInv(gs, ls, E1), pre(gs, ls, E1, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E1, a) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns), ∀ node0, nd0, success0. a ≠ chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pre-E1, seq:⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. ( ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬ (∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 607 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pre(gs, ls, E1, a) ↔ (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))

A spec-lemma

Proof step 608 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E1, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ ( (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns), ∀ node0, nd0, success0. a ≠ chooseE1(node0, nd0, success0), (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Used simplifier rules: ⊦ pcstepf(gs, ls, E1, a) = (∃ node0, nd0, success0. a = chooseE1(node0, nd0, success0) ⊃ E2;E1); (s) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E1, τ) = gs; (s) ⊦ lstepf(gs, ls, E1, τ) = ls; (s)

Proof step 609 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E1, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ ( (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns), ∀ node0, nd0, success0. a ≠ chooseE1(node0, nd0, success0), ∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 610 from proof copied-step-DMSQLInv (previous step) (back to tree)

success0 ↔ false, a = chooseE1(node0, nd0, success0), gs0 = gstepf(gs, ls, E1, a), ls0 = lstepf(gs, ls, E1, a), pc0 = E1, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ ( (∃ node0, nd0, success0. (¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false)) ∧ a = chooseE1(node0, nd0, success0)) ∨ a = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))) ∧ pcstepf(gs, ls, E1, a) = E1 → ( listp(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ ¬ dups(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).ps) ∧ markedp(gstepf(gs, ls, E1, a).orl, gstepf(gs, ls, E1, a).vs) ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).ps) ∧ gstepf(gs, ls, E1, a).orl ≠ [] ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl ∧ rvownerok(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp, gstepf(gs, ls, E1, a).rvowns) ∧ allocrv(gstepf(gs, ls, E1, a).pretRefs, gstepf(gs, ls, E1, a).prvHp) ∧ dom gstepf(gs, ls, E1, a).vrvHp = dom gstepf(gs, ls, E1, a).prvHp ∧ ( gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next ≠ null ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E1, a).rvowns (gstepf(gs, ls, E1, a).vretRefs(gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].deqID.tid, gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E1, a).orl.last = gstepf(gs, ls, E1, a).vhead ∧ (gstepf(gs, ls, E1, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, a).qrl.tail, gstepf(gs, ls, E1, a).vs)) ∨ gstepf(gs, ls, E1, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, a).orl.butlast.last = gstepf(gs, ls, E1, a).vhead ∧ gstepf(gs, ls, E1, a).phead ≠ gstepf(gs, ls, E1, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs)) ∧ ( gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last ∨ gstepf(gs, ls, E1, a).qrl ≠ [] ∧ gstepf(gs, ls, E1, a).vtail = (gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl.butlast).last ∧ gstepf(gs, ls, E1, a).vs[gstepf(gs, ls, E1, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, a).vs[(gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noid(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ noowns(lstepf(gs, ls, E1, a).tid, gstepf(gs, ls, E1, a).owns), ∀ node0, nd0, success0. a ≠ chooseE1(node0, nd0, success0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 2, flags: discard

Additional information

Proof step 611 from proof copied-step-DMSQLInv (previous step) (back to tree)

success0 ↔ false, gs0 = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), ls0 = lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)), pc0 = E1, node0 ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E1), ¬ node0 ∈ gs.ps, ¬ node0 ∈ gs.vs, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ ( (∃ node, nd, success. (¬ node ∈ gs.vs ∧ ¬ node ∈ gs.ps ∧ node ≠ null ∧ (success ↔ false)) ∧ chooseE1(node0, nd0, success0) = chooseE1(node, nd, success)) ∨ chooseE1(node0, nd0, success0) = τ ∧ ¬(∃ node0, nd0, success0. ¬ node0 ∈ gs.vs ∧ ¬ node0 ∈ gs.ps ∧ node0 ≠ null ∧ (success0 ↔ false))) ∧ pcstepf(gs, ls, E1, chooseE1(node0, nd0, success0)) = E1 → ( listp (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns) ∧ ¬ dups(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl) ∧ markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps) ∧ markedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).ps) ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ∈ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl ∧ rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns) ∧ allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs) ∧ rvownerok (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns) ∧ allocrv(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).pretRefs, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp) ∧ dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vrvHp = dom gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).prvHp ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ≠ null ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).rvowns (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vretRefs (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .deqID .tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.tail, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs)) ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.butlast.last = gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).phead ≠ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl.last ∧ unmarkedp(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs)) ∧ ( gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ∨ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl ≠ [] ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vtail = (gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.butlast).last ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs[gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl.last].deqID = None ∧ gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs [(gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ noid (lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).orl + gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).qrl, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vhead, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).vs) ∧ noowns(lstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).tid, gstepf(gs, ls, E1, chooseE1(node0, nd0, success0)).owns), ∀ node, nd, success. chooseE1(node0, nd0, success0) ≠ chooseE1(node, nd, success) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule all left

And closed the goal!

Rule argument

pos: left 11 terms: node0, nd0, success0 abort: F discard: T computed: T

Additional information

Used terms: node0, nd0, success0

Proof step 612 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E2, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 613 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = pcstepf(gs, ls, E2, a), DMSQGInv(gs), DMSQLInv(gs, ls, E2), pre(gs, ls, E2, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E2, seq: ⊦ pcstepf(gs, ls, E2, a) = E3, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 614 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E2, a) = E3

A spec-lemma

Proof step 615 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, DMSQGInv(gs), DMSQLInv(gs, ls, E2), pre(gs, ls, E2, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E2-E3, seq:⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok (gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv (gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv (gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs [gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs (gstepf(gs, ls, E2, a).vs [gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E2, a).vs [gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E2, a).vs [gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ ( gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = ( gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast ).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E2, a).vs [(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid (lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid (lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns (lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 616 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps)

Lemma step-E2-E3

Proof step 617 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, DMSQGInv(gs), DMSQLInv(gs, ls, E2), pre(gs, ls, E2, a), ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3 → gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid) ∧ ( listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps) ∧ markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs) ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps) ∧ gstepf(gs, ls, E2, a).orl ≠ [] ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl ∧ rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns) ∧ allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp) ∧ dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp ∧ ( gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs)) ∧ ( gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps ∧ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs ∧ lstepf(gs, ls, E2, a).node ≠ null ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl ∧ ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl) ∧ gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null) ∧ ¬ lstepf(gs, ls, E2, a).success ∧ nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 618 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, DMSQGInv(gs), DMSQLInv(gs, ls, E2), pre(gs, ls, E2, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 619 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 620 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, gs.orl ≠ [], DMSQLInv(gs, ls, E2), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E2, a) ∧ pcstepf(gs, ls, E2, a) = E3, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E2], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E2; (s) ⊦ D2 ≠ E2; (s) ⊦ E2 ≠ E17; (s) ⊦ E2 ≠ crashed; (s) ⊦ E2 ≠ idle; (s) ⊦ E2 ≠ ready; (s) ⊦ E1 ≠ E2; (s) ⊦ D7 ≠ E2; (s) ⊦ D32 ≠ E2; (s) ⊦ D33 ≠ E2; (s) ⊦ E2 ≠ E4; (s) ⊦ E2 ≠ E16; (s) ⊦ E2 ≠ E15; (s) ⊦ E2 ≠ E14; (s) ⊦ E2 ≠ E13; (s) ⊦ E2 ≠ E12; (s) ⊦ E2 ≠ E11; (s) ⊦ E2 ≠ E10; (s) ⊦ E2 ≠ E9; (s) ⊦ E2 ≠ E8; (s) ⊦ E2 ≠ E7; (s) ⊦ E2 ≠ E6; (s) ⊦ E2 ≠ E5; (s) ⊦ E2 ≠ E3; (s) ⊦ D34 ≠ E2; (s) ⊦ D31 ≠ E2; (s) ⊦ D30 ≠ E2; (s) ⊦ D29 ≠ E2; (s) ⊦ D28 ≠ E2; (s) ⊦ D27 ≠ E2; (s) ⊦ D26 ≠ E2; (s) ⊦ D25 ≠ E2; (s) ⊦ D24 ≠ E2; (s) ⊦ D23 ≠ E2; (s) ⊦ D22 ≠ E2; (s) ⊦ D21 ≠ E2; (s) ⊦ D20 ≠ E2; (s) ⊦ D19 ≠ E2; (s) ⊦ D18 ≠ E2; (s) ⊦ D17 ≠ E2; (s) ⊦ D16 ≠ E2; (s) ⊦ D15 ≠ E2; (s) ⊦ D14 ≠ E2; (s) ⊦ D13 ≠ E2; (s) ⊦ D12 ≠ E2; (s) ⊦ D11 ≠ E2; (s) ⊦ D10 ≠ E2; (s) ⊦ D9 ≠ E2; (s) ⊦ D8 ≠ E2; (s) ⊦ D6 ≠ E2; (s) ⊦ D5 ≠ E2; (s) ⊦ D4 ≠ E2; (s) ⊦ D3 ≠ E2; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E2, a) = E3; (s) Used terms: gs, ls, E2

Proof step 621 from proof copied-step-DMSQLInv (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 622 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid), gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null), dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp, gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, lstepf(gs, ls, E2, a).node ≠ null, gstepf(gs, ls, E2, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E2), allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp), allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp), listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns), markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps), markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs), nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs), noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs), nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs), oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps), pre(gs, ls, E2, a), rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns), rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns), unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps), gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl, lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps, lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs, ¬ lstepf(gs, ls, E2, a).success, ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl), ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl, ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val), gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs), gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 623 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 624 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E2, a).owns(lstepf(gs, ls, E2, a).node) = Some(lstepf(gs, ls, E2, a).tid), gstepf(gs, ls, E2, a).vs[lstepf(gs, ls, E2, a).node] = mk(lstepf(gs, ls, E2, a).value, None, null), dom gstepf(gs, ls, E2, a).vrvHp = dom gstepf(gs, ls, E2, a).prvHp, gs0 = gstepf(gs, ls, E2, a), ls0 = lstepf(gs, ls, E2, a), pc0 = E3, lstepf(gs, ls, E2, a).node ≠ null, gstepf(gs, ls, E2, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E2), allocrv(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp), allocrv(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp), listp(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns), markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs), markedp(gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).ps), nextnottid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs), noid(lstepf(gs, ls, E2, a).tid, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs), nonullRetRefs (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).pretRefs), oneowns(lstepf(gs, ls, E2, a).tid, lstepf(gs, ls, E2, a).node, gstepf(gs, ls, E2, a).owns, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps), pre(gs, ls, E2, a), rvownerok(gstepf(gs, ls, E2, a).pretRefs, gstepf(gs, ls, E2, a).prvHp, gstepf(gs, ls, E2, a).rvowns), rvownerok(gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp, gstepf(gs, ls, E2, a).rvowns), unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).ps), lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).vs, lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl, ¬ lstepf(gs, ls, E2, a).success, ¬ dups(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl), ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).qrl, ¬ lstepf(gs, ls, E2, a).node ∈ gstepf(gs, ls, E2, a).orl, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next ≠ null ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E2, a).rvowns (gstepf(gs, ls, E2, a).vretRefs(gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].deqID.tid, gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).vhead].next].val), gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last ∨ gstepf(gs, ls, E2, a).qrl ≠ [] ∧ gstepf(gs, ls, E2, a).vtail = (gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl.butlast).last ∧ gstepf(gs, ls, E2, a).vs[gstepf(gs, ls, E2, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E2, a).vs[(gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl).last].next = null, gstepf(gs, ls, E2, a).orl.last = gstepf(gs, ls, E2, a).vhead ∧ (gstepf(gs, ls, E2, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E2, a).qrl.tail, gstepf(gs, ls, E2, a).vs)) ∨ gstepf(gs, ls, E2, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E2, a).orl.butlast.last = gstepf(gs, ls, E2, a).vhead ∧ gstepf(gs, ls, E2, a).phead ≠ gstepf(gs, ls, E2, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E2, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E3 ≠ E5; (s) ⊦ E3 ≠ E6; (s) ⊦ E3 ≠ E7; (s) ⊦ E3 ≠ E8; (s) ⊦ E3 ≠ E9; (s) ⊦ E3 ≠ E13; (s) ⊦ E3 ≠ E14; (s) ⊦ E3 ≠ E15; (s) ⊦ E3 ≠ E16; (s) ⊦ E3 ≠ crashed; (s) ⊦ E3 ≠ idle; (s) ⊦ E3 ≠ ready; (s) ⊦ D1 ≠ E3; (s) ⊦ D2 ≠ E3; (s) ⊦ D3 ≠ E3; (s) ⊦ D4 ≠ E3; (s) ⊦ D5 ≠ E3; (s) ⊦ D6 ≠ E3; (s) ⊦ D7 ≠ E3; (s) ⊦ D8 ≠ E3; (s) ⊦ D9 ≠ E3; (s) ⊦ D10 ≠ E3; (s) ⊦ D11 ≠ E3; (s) ⊦ D12 ≠ E3; (s) ⊦ D13 ≠ E3; (s) ⊦ D14 ≠ E3; (s) ⊦ D15 ≠ E3; (s) ⊦ D16 ≠ E3; (s) ⊦ D17 ≠ E3; (s) ⊦ D18 ≠ E3; (s) ⊦ D19 ≠ E3; (s) ⊦ D20 ≠ E3; (s) ⊦ D21 ≠ E3; (s) ⊦ D22 ≠ E3; (s) ⊦ D23 ≠ E3; (s) ⊦ D24 ≠ E3; (s) ⊦ D25 ≠ E3; (s) ⊦ D26 ≠ E3; (s) ⊦ D27 ≠ E3; (s) ⊦ D28 ≠ E3; (s) ⊦ D29 ≠ E3; (s) ⊦ D30 ≠ E3; (s) ⊦ D31 ≠ E3; (s) ⊦ D32 ≠ E3; (s) ⊦ D33 ≠ E3; (s) ⊦ D34 ≠ E3; (s) ⊦ E1 ≠ E3; (s) ⊦ E3 ≠ E12; (s) ⊦ E3 ≠ E17; (s) ⊦ E2 ≠ E3; (s) ⊦ E3 ≠ E10; (s) ⊦ E3 ≠ E11; (s) ⊦ E3 ≠ E4; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.vs:= ps0).owns = gs.owns; (s) ⊦ (gs.vs:= ps0).vs = ps0; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ mk(val, opttid, nxt) = mk(val0, opttid0, nxt0) ↔ val = val0 ∧ opttid = opttid0 ∧ nxt = nxt0; (ws) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, E2, τ) = gs.vs:= gs.vs[ls.node, mk(ls.value, None, null)]; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, E2, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 625 from proof copied-step-DMSQLInv (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 626 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E3, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 627 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = pcstepf(gs, ls, E3, a), DMSQGInv(gs), DMSQLInv(gs, ls, E3), pre(gs, ls, E3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E3, seq: ⊦ pcstepf(gs, ls, E3, a) = E4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 628 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E3, a) = E4

A spec-lemma

Proof step 629 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E3), pre(gs, ls, E3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E3-E4, seq:⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → ( listp (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok (gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv (gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv (gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs [gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs (gstepf(gs, ls, E3, a).vs [gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E3, a).vs [gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E3, a).vs [gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ ( gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = ( gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast ).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E3, a).vs [(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid (lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid (lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns (lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 630 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → ( listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) )

Lemma step-E3-E4

Proof step 631 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E3), pre(gs, ls, E3, a), ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4 → ( listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps) ∧ markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs) ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps) ∧ gstepf(gs, ls, E3, a).orl ≠ [] ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl ∧ rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns) ∧ allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp) ∧ dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp ∧ ( gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs)) ∧ ( gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node]) ∧ nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 632 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E3), pre(gs, ls, E3, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 633 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 634 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, gs.orl ≠ [], DMSQLInv(gs, ls, E3), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E3, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E3, a) ∧ pcstepf(gs, ls, E3, a) = E4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E3], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E3; (s) ⊦ D2 ≠ E3; (s) ⊦ E3 ≠ E17; (s) ⊦ E3 ≠ crashed; (s) ⊦ E3 ≠ idle; (s) ⊦ E3 ≠ ready; (s) ⊦ E1 ≠ E3; (s) ⊦ D7 ≠ E3; (s) ⊦ D32 ≠ E3; (s) ⊦ D33 ≠ E3; (s) ⊦ E3 ≠ E4; (s) ⊦ E3 ≠ E16; (s) ⊦ E3 ≠ E15; (s) ⊦ E3 ≠ E14; (s) ⊦ E3 ≠ E13; (s) ⊦ E3 ≠ E12; (s) ⊦ E3 ≠ E11; (s) ⊦ E3 ≠ E10; (s) ⊦ E3 ≠ E9; (s) ⊦ E3 ≠ E8; (s) ⊦ E3 ≠ E7; (s) ⊦ E3 ≠ E6; (s) ⊦ E3 ≠ E5; (s) ⊦ E2 ≠ E3; (s) ⊦ D34 ≠ E3; (s) ⊦ D31 ≠ E3; (s) ⊦ D30 ≠ E3; (s) ⊦ D29 ≠ E3; (s) ⊦ D28 ≠ E3; (s) ⊦ D27 ≠ E3; (s) ⊦ D26 ≠ E3; (s) ⊦ D25 ≠ E3; (s) ⊦ D24 ≠ E3; (s) ⊦ D23 ≠ E3; (s) ⊦ D22 ≠ E3; (s) ⊦ D21 ≠ E3; (s) ⊦ D20 ≠ E3; (s) ⊦ D19 ≠ E3; (s) ⊦ D18 ≠ E3; (s) ⊦ D17 ≠ E3; (s) ⊦ D16 ≠ E3; (s) ⊦ D15 ≠ E3; (s) ⊦ D14 ≠ E3; (s) ⊦ D13 ≠ E3; (s) ⊦ D12 ≠ E3; (s) ⊦ D11 ≠ E3; (s) ⊦ D10 ≠ E3; (s) ⊦ D9 ≠ E3; (s) ⊦ D8 ≠ E3; (s) ⊦ D6 ≠ E3; (s) ⊦ D5 ≠ E3; (s) ⊦ D4 ≠ E3; (s) ⊦ D3 ≠ E3; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E3, a) = E4; (s) Used terms: gs, ls, E3

Proof step 635 from proof copied-step-DMSQLInv (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 636 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp, gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, gstepf(gs, ls, E3, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E3), allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp), allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp), listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns), markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps), markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs), nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs), noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs), nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs), pre(gs, ls, E3, a), rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns), rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns), unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps), gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl, ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl), gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val), ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node], (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ), gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs), gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 637 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 638 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E3, a).vrvHp = dom gstepf(gs, ls, E3, a).prvHp, gs0 = gstepf(gs, ls, E3, a), ls0 = lstepf(gs, ls, E3, a), pc0 = E4, gstepf(gs, ls, E3, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E3), allocrv(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp), allocrv(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp), listp(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns), markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).vs), markedp(gstepf(gs, ls, E3, a).orl, gstepf(gs, ls, E3, a).ps), nextnottid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs), noid(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs), nonullRetRefs (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).pretRefs), pre(gs, ls, E3, a), rvownerok(gstepf(gs, ls, E3, a).pretRefs, gstepf(gs, ls, E3, a).prvHp, gstepf(gs, ls, E3, a).rvowns), rvownerok(gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp, gstepf(gs, ls, E3, a).rvowns), unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).ps), gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl, ¬ dups(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl), ¬ lstepf(gs, ls, E3, a).success → ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).orl ∧ ¬ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).qrl ∧ lstepf(gs, ls, E3, a).node ≠ null ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).ps ∧ lstepf(gs, ls, E3, a).node ∈ gstepf(gs, ls, E3, a).vs ∧ gstepf(gs, ls, E3, a).owns(lstepf(gs, ls, E3, a).node) = Some(lstepf(gs, ls, E3, a).tid) ∧ gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node] = mk(lstepf(gs, ls, E3, a).value, None, null) ∧ gstepf(gs, ls, E3, a).ps[lstepf(gs, ls, E3, a).node] = gstepf(gs, ls, E3, a).vs[lstepf(gs, ls, E3, a).node], gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next ≠ null ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E3, a).rvowns (gstepf(gs, ls, E3, a).vretRefs(gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].deqID.tid, gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).vhead].next].val), (lstepf(gs, ls, E3, a).success ⊃ noowns(lstepf(gs, ls, E3, a).tid, gstepf(gs, ls, E3, a).owns) ;oneowns(lstepf(gs, ls, E3, a).tid, lstepf(gs, ls, E3, a).node, gstepf(gs, ls, E3, a).owns, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ), gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last ∨ gstepf(gs, ls, E3, a).qrl ≠ [] ∧ gstepf(gs, ls, E3, a).vtail = (gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl.butlast).last ∧ gstepf(gs, ls, E3, a).vs[gstepf(gs, ls, E3, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E3, a).vs[(gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl).last].next = null, gstepf(gs, ls, E3, a).orl.last = gstepf(gs, ls, E3, a).vhead ∧ (gstepf(gs, ls, E3, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E3, a).qrl.tail, gstepf(gs, ls, E3, a).vs)) ∨ gstepf(gs, ls, E3, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E3, a).orl.butlast.last = gstepf(gs, ls, E3, a).vhead ∧ gstepf(gs, ls, E3, a).phead ≠ gstepf(gs, ls, E3, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E3, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ E5; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E11; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ gstepf(gs, ls, E3, τ) = gs.ps:= gs.ps[ls.node, gs.vs[ls.node]]; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ lstepf(gs, ls, E3, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 639 from proof copied-step-DMSQLInv (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 640 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E4, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 641 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = pcstepf(gs, ls, E4, a), DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E4, seq: ⊦ pcstepf(gs, ls, E4, a) = (¬ ls.success ⊃ E5;E17), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 642 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E4, a) = (¬ ls.success ⊃ E5;E17)

A spec-lemma

Proof step 643 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = (¬ ls.success ⊃ E5;E17), DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 644 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E4-E5, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E5 → gstepf(gs, ls, E4, a).owns(lstepf(gs, ls, E4, a).node) = Some(lstepf(gs, ls, E4, a).tid) ∧ ( listp (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok (gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv (gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv (gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs (gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ ( gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = ( gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast ).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E4, a).vs [(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).ps ∧ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).vs ∧ lstepf(gs, ls, E4, a).node ≠ null ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).orl ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).qrl) ∧ gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] = mk(lstepf(gs, ls, E4, a).value, None, null) ∧ gstepf(gs, ls, E4, a).ps[lstepf(gs, ls, E4, a).node] = gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] ∧ ¬ lstepf(gs, ls, E4, a).success ∧ nextnottid (lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid (lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ oneowns (lstepf(gs, ls, E4, a).tid, lstepf(gs, ls, E4, a).node, gstepf(gs, ls, E4, a).owns, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 645 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E5 → gstepf(gs, ls, E4, a).owns(lstepf(gs, ls, E4, a).node) = Some(lstepf(gs, ls, E4, a).tid) ∧ ( listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).ps ∧ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).vs ∧ lstepf(gs, ls, E4, a).node ≠ null ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).orl ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).qrl) ∧ gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] = mk(lstepf(gs, ls, E4, a).value, None, null) ∧ gstepf(gs, ls, E4, a).ps[lstepf(gs, ls, E4, a).node] = gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] ∧ ¬ lstepf(gs, ls, E4, a).success ∧ nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ oneowns(lstepf(gs, ls, E4, a).tid, lstepf(gs, ls, E4, a).node, gstepf(gs, ls, E4, a).owns, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps)

Lemma step-E4-E5

Proof step 646 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a), ¬ ls.success, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E5 → gstepf(gs, ls, E4, a).owns(lstepf(gs, ls, E4, a).node) = Some(lstepf(gs, ls, E4, a).tid) ∧ ( listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).ps ∧ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).vs ∧ lstepf(gs, ls, E4, a).node ≠ null ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).orl ∧ ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).qrl) ∧ gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] = mk(lstepf(gs, ls, E4, a).value, None, null) ∧ gstepf(gs, ls, E4, a).ps[lstepf(gs, ls, E4, a).node] = gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] ∧ ¬ lstepf(gs, ls, E4, a).success ∧ nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ oneowns(lstepf(gs, ls, E4, a).tid, lstepf(gs, ls, E4, a).node, gstepf(gs, ls, E4, a).owns, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 647 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E5

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 648 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 649 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, gs.orl ≠ [], DMSQLInv(gs, ls, E4), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E5, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E4], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ E4 ≠ E17; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ E1 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E5; (s) ⊦ E3 ≠ E4; (s) ⊦ E2 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E4, a) = (¬ ls.success ⊃ E5;E17); (s) Used terms: gs, ls, E4

Proof step 650 from proof copied-step-DMSQLInv (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 651 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E4, a).owns(lstepf(gs, ls, E4, a).node) = Some(lstepf(gs, ls, E4, a).tid), gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] = mk(lstepf(gs, ls, E4, a).value, None, null), gstepf(gs, ls, E4, a).ps[lstepf(gs, ls, E4, a).node] = gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node], dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, lstepf(gs, ls, E4, a).node ≠ null, gstepf(gs, ls, E4, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E4), allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp), allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp), listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs), nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs), oneowns(lstepf(gs, ls, E4, a).tid, lstepf(gs, ls, E4, a).node, gstepf(gs, ls, E4, a).owns, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps), pre(gs, ls, E4, a), rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns), rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns), unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps), gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl, lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).ps, lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).vs, ¬ lstepf(gs, ls, E4, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl), ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).qrl, ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val), gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs), gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 652 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 653 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E4, a).owns(lstepf(gs, ls, E4, a).node) = Some(lstepf(gs, ls, E4, a).tid), gstepf(gs, ls, E4, a).ps[lstepf(gs, ls, E4, a).node] = gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node], gstepf(gs, ls, E4, a).vs[lstepf(gs, ls, E4, a).node] = mk(lstepf(gs, ls, E4, a).value, None, null), dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E5, lstepf(gs, ls, E4, a).node ≠ null, gstepf(gs, ls, E4, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E4), allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp), allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp), listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps), nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs), oneowns(lstepf(gs, ls, E4, a).tid, lstepf(gs, ls, E4, a).node, gstepf(gs, ls, E4, a).owns, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps), pre(gs, ls, E4, a), rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns), rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns), unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps), lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).vs, lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl, ¬ lstepf(gs, ls, E4, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl), ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).qrl, ¬ lstepf(gs, ls, E4, a).node ∈ gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val), gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null, gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E5 ≠ E6; (s) ⊦ E5 ≠ E7; (s) ⊦ E5 ≠ E8; (s) ⊦ E5 ≠ E9; (s) ⊦ E5 ≠ E13; (s) ⊦ E5 ≠ E14; (s) ⊦ E5 ≠ E15; (s) ⊦ E5 ≠ E16; (s) ⊦ E5 ≠ crashed; (s) ⊦ E5 ≠ idle; (s) ⊦ E5 ≠ ready; (s) ⊦ D1 ≠ E5; (s) ⊦ D2 ≠ E5; (s) ⊦ D3 ≠ E5; (s) ⊦ D4 ≠ E5; (s) ⊦ D5 ≠ E5; (s) ⊦ D6 ≠ E5; (s) ⊦ D7 ≠ E5; (s) ⊦ D8 ≠ E5; (s) ⊦ D9 ≠ E5; (s) ⊦ D10 ≠ E5; (s) ⊦ D11 ≠ E5; (s) ⊦ D12 ≠ E5; (s) ⊦ D13 ≠ E5; (s) ⊦ D14 ≠ E5; (s) ⊦ D15 ≠ E5; (s) ⊦ D16 ≠ E5; (s) ⊦ D17 ≠ E5; (s) ⊦ D18 ≠ E5; (s) ⊦ D19 ≠ E5; (s) ⊦ D20 ≠ E5; (s) ⊦ D21 ≠ E5; (s) ⊦ D22 ≠ E5; (s) ⊦ D23 ≠ E5; (s) ⊦ D24 ≠ E5; (s) ⊦ D25 ≠ E5; (s) ⊦ D26 ≠ E5; (s) ⊦ D27 ≠ E5; (s) ⊦ D28 ≠ E5; (s) ⊦ D29 ≠ E5; (s) ⊦ D30 ≠ E5; (s) ⊦ D31 ≠ E5; (s) ⊦ D32 ≠ E5; (s) ⊦ D33 ≠ E5; (s) ⊦ D34 ≠ E5; (s) ⊦ E1 ≠ E5; (s) ⊦ E5 ≠ E12; (s) ⊦ E5 ≠ E17; (s) ⊦ E2 ≠ E5; (s) ⊦ E3 ≠ E5; (s) ⊦ E5 ≠ E10; (s) ⊦ E5 ≠ E11; (s) ⊦ E4 ≠ E5; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E4, τ) = gs; (s) ⊦ lstepf(gs, ls, E4, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 654 from proof copied-step-DMSQLInv (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 655 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E4-E17, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns) ;oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps) )) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E17 → ( listp (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok (gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv (gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv (gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs (gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E4, a).vs [gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ ( gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = ( gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast ).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E4, a).vs [(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid (lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noowns(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 656 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E17 → ( listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noowns(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).owns)

Lemma step-E4-E17

Proof step 657 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E17 → ( listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns) ∧ ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps) ∧ markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs) ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps) ∧ gstepf(gs, ls, E4, a).orl ≠ [] ∧ gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl ∧ rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns) ∧ allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp) ∧ dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp ∧ ( gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs)) ∧ ( gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs) ∧ noowns(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 658 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E4), pre(gs, ls, E4, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E17

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 659 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 660 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, gs.orl ≠ [], ls.success, DMSQLInv(gs, ls, E4), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E4, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs.owns);oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps))) ∧ pre(gs, ls, E4, a) ∧ pcstepf(gs, ls, E4, a) = E17, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E4], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ E4 ≠ E17; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ E1 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E11; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E5; (s) ⊦ E3 ≠ E4; (s) ⊦ E2 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E4, a) = (¬ ls.success ⊃ E5;E17); (s) Used terms: gs, ls, E4

Proof step 661 from proof copied-step-DMSQLInv (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 662 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, gstepf(gs, ls, E4, a).orl ≠ [], ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E4), allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp), allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp), listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs), nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs), noowns(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).owns), pre(gs, ls, E4, a), rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns), rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns), unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps), gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl, ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl), gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val), gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs), gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 663 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 664 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E4, a).vrvHp = dom gstepf(gs, ls, E4, a).prvHp, gs0 = gstepf(gs, ls, E4, a), ls0 = lstepf(gs, ls, E4, a), pc0 = E17, gstepf(gs, ls, E4, a).orl ≠ [], ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E4), allocrv(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp), allocrv(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp), listp(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).ps, gstepf(gs, ls, E4, a).owns), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).vs), markedp(gstepf(gs, ls, E4, a).orl, gstepf(gs, ls, E4, a).ps), nextnottid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), noid(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vhead, gstepf(gs, ls, E4, a).vs), nonullRetRefs (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs, gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).pretRefs), noowns(lstepf(gs, ls, E4, a).tid, gstepf(gs, ls, E4, a).owns), pre(gs, ls, E4, a), rvownerok(gstepf(gs, ls, E4, a).pretRefs, gstepf(gs, ls, E4, a).prvHp, gstepf(gs, ls, E4, a).rvowns), rvownerok(gstepf(gs, ls, E4, a).vretRefs, gstepf(gs, ls, E4, a).vrvHp, gstepf(gs, ls, E4, a).rvowns), unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).ps), gstepf(gs, ls, E4, a).phead ∈ gstepf(gs, ls, E4, a).orl, ¬ dups(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl), gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next ≠ null ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E4, a).rvowns (gstepf(gs, ls, E4, a).vretRefs(gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].deqID.tid, gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).vhead].next].val), gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last ∨ gstepf(gs, ls, E4, a).qrl ≠ [] ∧ gstepf(gs, ls, E4, a).vtail = (gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl.butlast).last ∧ gstepf(gs, ls, E4, a).vs[gstepf(gs, ls, E4, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E4, a).vs[(gstepf(gs, ls, E4, a).orl + gstepf(gs, ls, E4, a).qrl).last].next = null, gstepf(gs, ls, E4, a).orl.last = gstepf(gs, ls, E4, a).vhead ∧ (gstepf(gs, ls, E4, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E4, a).qrl.tail, gstepf(gs, ls, E4, a).vs)) ∨ gstepf(gs, ls, E4, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E4, a).orl.butlast.last = gstepf(gs, ls, E4, a).vhead ∧ gstepf(gs, ls, E4, a).phead ≠ gstepf(gs, ls, E4, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E4, a).qrl, gstepf(gs, ls, E4, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E4, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E17 ≠ crashed; (s) ⊦ E17 ≠ idle; (s) ⊦ E17 ≠ ready; (s) ⊦ D1 ≠ E17; (s) ⊦ D2 ≠ E17; (s) ⊦ D3 ≠ E17; (s) ⊦ D4 ≠ E17; (s) ⊦ D5 ≠ E17; (s) ⊦ D6 ≠ E17; (s) ⊦ D7 ≠ E17; (s) ⊦ D8 ≠ E17; (s) ⊦ D9 ≠ E17; (s) ⊦ D10 ≠ E17; (s) ⊦ D11 ≠ E17; (s) ⊦ D12 ≠ E17; (s) ⊦ D13 ≠ E17; (s) ⊦ D14 ≠ E17; (s) ⊦ D15 ≠ E17; (s) ⊦ D16 ≠ E17; (s) ⊦ D17 ≠ E17; (s) ⊦ D18 ≠ E17; (s) ⊦ D19 ≠ E17; (s) ⊦ D20 ≠ E17; (s) ⊦ D21 ≠ E17; (s) ⊦ D22 ≠ E17; (s) ⊦ D23 ≠ E17; (s) ⊦ D24 ≠ E17; (s) ⊦ D25 ≠ E17; (s) ⊦ D26 ≠ E17; (s) ⊦ D27 ≠ E17; (s) ⊦ D28 ≠ E17; (s) ⊦ D29 ≠ E17; (s) ⊦ D30 ≠ E17; (s) ⊦ D31 ≠ E17; (s) ⊦ D32 ≠ E17; (s) ⊦ D33 ≠ E17; (s) ⊦ D34 ≠ E17; (s) ⊦ E1 ≠ E17; (s) ⊦ E12 ≠ E17; (s) ⊦ E2 ≠ E17; (s) ⊦ E3 ≠ E17; (s) ⊦ E5 ≠ E17; (s) ⊦ E6 ≠ E17; (s) ⊦ E7 ≠ E17; (s) ⊦ E8 ≠ E17; (s) ⊦ E9 ≠ E17; (s) ⊦ E13 ≠ E17; (s) ⊦ E14 ≠ E17; (s) ⊦ E15 ≠ E17; (s) ⊦ E16 ≠ E17; (s) ⊦ E10 ≠ E17; (s) ⊦ E11 ≠ E17; (s) ⊦ E4 ≠ E17; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E4, τ) = gs; (s) ⊦ lstepf(gs, ls, E4, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 665 from proof copied-step-DMSQLInv (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 666 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E5, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 667 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = pcstepf(gs, ls, E5, a), DMSQGInv(gs), DMSQLInv(gs, ls, E5), pre(gs, ls, E5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E5, seq: ⊦ pcstepf(gs, ls, E5, a) = E6, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 668 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E5, a) = E6

A spec-lemma

Proof step 669 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, DMSQGInv(gs), DMSQLInv(gs, ls, E5), pre(gs, ls, E5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E5-E6, seq:⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6 → ( gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid) ∧ lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ∧ ( gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail)) ∧ ( listp (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns) ∧ ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs) ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps) ∧ gstepf(gs, ls, E5, a).orl ≠ [] ∧ gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl ∧ rvownerok (gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv (gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv (gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp) ∧ dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp ∧ ( gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs [gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs (gstepf(gs, ls, E5, a).vs [gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E5, a).vs [gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E5, a).vs [gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ ( gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs)) ∧ ( gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = ( gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast ).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E5, a).vs [(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps ∧ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs ∧ lstepf(gs, ls, E5, a).node ≠ null ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl) ∧ gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null) ∧ gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] ∧ ¬ lstepf(gs, ls, E5, a).success ∧ nextnottid (lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ noid (lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ oneowns (lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 670 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6 → ( gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid) ∧ lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ∧ (gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail)) ∧ ( listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns) ∧ ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs) ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps) ∧ gstepf(gs, ls, E5, a).orl ≠ [] ∧ gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl ∧ rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp) ∧ dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp ∧ ( gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs)) ∧ ( gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps ∧ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs ∧ lstepf(gs, ls, E5, a).node ≠ null ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl) ∧ gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null) ∧ gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] ∧ ¬ lstepf(gs, ls, E5, a).success ∧ nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps)

Lemma step-E5-E6

Proof step 671 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, DMSQGInv(gs), DMSQLInv(gs, ls, E5), pre(gs, ls, E5, a), ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6 → ( gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid) ∧ lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl ∧ (gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail)) ∧ ( listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns) ∧ ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps) ∧ markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs) ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps) ∧ gstepf(gs, ls, E5, a).orl ≠ [] ∧ gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl ∧ rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns) ∧ allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp) ∧ dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp ∧ ( gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs)) ∧ ( gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps ∧ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs ∧ lstepf(gs, ls, E5, a).node ≠ null ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl ∧ ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl) ∧ gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null) ∧ gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] ∧ ¬ lstepf(gs, ls, E5, a).success ∧ nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs) ∧ oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 672 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, DMSQGInv(gs), DMSQLInv(gs, ls, E5), pre(gs, ls, E5, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 673 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 674 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, gs.orl ≠ [], DMSQLInv(gs, ls, E5), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E5, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E5, a) ∧ pcstepf(gs, ls, E5, a) = E6, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E5], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E5; (s) ⊦ D2 ≠ E5; (s) ⊦ E5 ≠ E17; (s) ⊦ E5 ≠ crashed; (s) ⊦ E5 ≠ idle; (s) ⊦ E5 ≠ ready; (s) ⊦ E1 ≠ E5; (s) ⊦ D7 ≠ E5; (s) ⊦ D32 ≠ E5; (s) ⊦ D33 ≠ E5; (s) ⊦ E4 ≠ E5; (s) ⊦ E5 ≠ E16; (s) ⊦ E5 ≠ E15; (s) ⊦ E5 ≠ E14; (s) ⊦ E5 ≠ E13; (s) ⊦ E5 ≠ E12; (s) ⊦ E5 ≠ E11; (s) ⊦ E5 ≠ E10; (s) ⊦ E5 ≠ E9; (s) ⊦ E5 ≠ E8; (s) ⊦ E5 ≠ E7; (s) ⊦ E5 ≠ E6; (s) ⊦ E3 ≠ E5; (s) ⊦ E2 ≠ E5; (s) ⊦ D34 ≠ E5; (s) ⊦ D31 ≠ E5; (s) ⊦ D30 ≠ E5; (s) ⊦ D29 ≠ E5; (s) ⊦ D28 ≠ E5; (s) ⊦ D27 ≠ E5; (s) ⊦ D26 ≠ E5; (s) ⊦ D25 ≠ E5; (s) ⊦ D24 ≠ E5; (s) ⊦ D23 ≠ E5; (s) ⊦ D22 ≠ E5; (s) ⊦ D21 ≠ E5; (s) ⊦ D20 ≠ E5; (s) ⊦ D19 ≠ E5; (s) ⊦ D18 ≠ E5; (s) ⊦ D17 ≠ E5; (s) ⊦ D16 ≠ E5; (s) ⊦ D15 ≠ E5; (s) ⊦ D14 ≠ E5; (s) ⊦ D13 ≠ E5; (s) ⊦ D12 ≠ E5; (s) ⊦ D11 ≠ E5; (s) ⊦ D10 ≠ E5; (s) ⊦ D9 ≠ E5; (s) ⊦ D8 ≠ E5; (s) ⊦ D6 ≠ E5; (s) ⊦ D5 ≠ E5; (s) ⊦ D4 ≠ E5; (s) ⊦ D3 ≠ E5; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E5, a) = E6; (s) Used terms: gs, ls, E5

Proof step 675 from proof copied-step-DMSQLInv (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 676 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid), gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null), gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node], dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp, gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, lstepf(gs, ls, E5, a).node ≠ null, gstepf(gs, ls, E5, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E5), allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp), allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp), listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns), markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps), markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs), nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs), noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs), nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs), oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps), pre(gs, ls, E5, a), rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns), rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns), unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps), lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl, lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps, lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs, ¬ lstepf(gs, ls, E5, a).success, ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl), ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl, ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val), gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs), gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 677 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 678 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E5, a).owns(lstepf(gs, ls, E5, a).node) = Some(lstepf(gs, ls, E5, a).tid), gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).node] = gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node], gstepf(gs, ls, E5, a).vs[lstepf(gs, ls, E5, a).node] = mk(lstepf(gs, ls, E5, a).value, None, null), dom gstepf(gs, ls, E5, a).vrvHp = dom gstepf(gs, ls, E5, a).prvHp, gs0 = gstepf(gs, ls, E5, a), ls0 = lstepf(gs, ls, E5, a), pc0 = E6, lstepf(gs, ls, E5, a).node ≠ null, gstepf(gs, ls, E5, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E5), allocrv(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp), allocrv(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp), listp(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).owns), markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs), markedp(gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).ps), nextnottid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs), noid(lstepf(gs, ls, E5, a).tid, gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vhead, gstepf(gs, ls, E5, a).vs), nonullRetRefs (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).pretRefs), oneowns(lstepf(gs, ls, E5, a).tid, lstepf(gs, ls, E5, a).node, gstepf(gs, ls, E5, a).owns, gstepf(gs, ls, E5, a).vs, gstepf(gs, ls, E5, a).ps), pre(gs, ls, E5, a), rvownerok(gstepf(gs, ls, E5, a).pretRefs, gstepf(gs, ls, E5, a).prvHp, gstepf(gs, ls, E5, a).rvowns), rvownerok(gstepf(gs, ls, E5, a).vretRefs, gstepf(gs, ls, E5, a).vrvHp, gstepf(gs, ls, E5, a).rvowns), unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).ps), lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).vs, lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).ps, gstepf(gs, ls, E5, a).phead ∈ gstepf(gs, ls, E5, a).orl, lstepf(gs, ls, E5, a).lst ∈ gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl, ¬ lstepf(gs, ls, E5, a).success, ¬ dups(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl), ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).qrl, ¬ lstepf(gs, ls, E5, a).node ∈ gstepf(gs, ls, E5, a).orl, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next ≠ null ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E5, a).rvowns (gstepf(gs, ls, E5, a).vretRefs(gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].deqID.tid, gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).vhead].next].val), gstepf(gs, ls, E5, a).ps[lstepf(gs, ls, E5, a).lst].next = null → lstepf(gs, ls, E5, a).lst = gstepf(gs, ls, E5, a).vtail, gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last ∨ gstepf(gs, ls, E5, a).qrl ≠ [] ∧ gstepf(gs, ls, E5, a).vtail = (gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl.butlast).last ∧ gstepf(gs, ls, E5, a).vs[gstepf(gs, ls, E5, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E5, a).vs[(gstepf(gs, ls, E5, a).orl + gstepf(gs, ls, E5, a).qrl).last].next = null, gstepf(gs, ls, E5, a).orl.last = gstepf(gs, ls, E5, a).vhead ∧ (gstepf(gs, ls, E5, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E5, a).qrl.tail, gstepf(gs, ls, E5, a).vs)) ∨ gstepf(gs, ls, E5, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E5, a).orl.butlast.last = gstepf(gs, ls, E5, a).vhead ∧ gstepf(gs, ls, E5, a).phead ≠ gstepf(gs, ls, E5, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E5, a).qrl, gstepf(gs, ls, E5, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E5, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E6 ≠ E7; (s) ⊦ E6 ≠ E8; (s) ⊦ E6 ≠ E9; (s) ⊦ E6 ≠ E13; (s) ⊦ E6 ≠ E14; (s) ⊦ E6 ≠ E15; (s) ⊦ E6 ≠ E16; (s) ⊦ E6 ≠ crashed; (s) ⊦ E6 ≠ idle; (s) ⊦ E6 ≠ ready; (s) ⊦ D1 ≠ E6; (s) ⊦ D2 ≠ E6; (s) ⊦ D3 ≠ E6; (s) ⊦ D4 ≠ E6; (s) ⊦ D5 ≠ E6; (s) ⊦ D6 ≠ E6; (s) ⊦ D7 ≠ E6; (s) ⊦ D8 ≠ E6; (s) ⊦ D9 ≠ E6; (s) ⊦ D10 ≠ E6; (s) ⊦ D11 ≠ E6; (s) ⊦ D12 ≠ E6; (s) ⊦ D13 ≠ E6; (s) ⊦ D14 ≠ E6; (s) ⊦ D15 ≠ E6; (s) ⊦ D16 ≠ E6; (s) ⊦ D17 ≠ E6; (s) ⊦ D18 ≠ E6; (s) ⊦ D19 ≠ E6; (s) ⊦ D20 ≠ E6; (s) ⊦ D21 ≠ E6; (s) ⊦ D22 ≠ E6; (s) ⊦ D23 ≠ E6; (s) ⊦ D24 ≠ E6; (s) ⊦ D25 ≠ E6; (s) ⊦ D26 ≠ E6; (s) ⊦ D27 ≠ E6; (s) ⊦ D28 ≠ E6; (s) ⊦ D29 ≠ E6; (s) ⊦ D30 ≠ E6; (s) ⊦ D31 ≠ E6; (s) ⊦ D32 ≠ E6; (s) ⊦ D33 ≠ E6; (s) ⊦ D34 ≠ E6; (s) ⊦ E1 ≠ E6; (s) ⊦ E6 ≠ E12; (s) ⊦ E6 ≠ E17; (s) ⊦ E2 ≠ E6; (s) ⊦ E3 ≠ E6; (s) ⊦ E5 ≠ E6; (s) ⊦ E6 ≠ E10; (s) ⊦ E6 ≠ E11; (s) ⊦ E4 ≠ E6; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.lst:= node0).node = ls.node; (s) ⊦ (ls.lst:= node0).value = ls.value; (s) ⊦ gstepf(gs, ls, E5, τ) = gs; (s) ⊦ lstepf(gs, ls, E5, τ) = ls.lst:= gs.vtail; (s) ⊦ (ls.lst:= node0).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 679 from proof copied-step-DMSQLInv (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 680 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E6, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 681 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = pcstepf(gs, ls, E6, a), DMSQGInv(gs), DMSQLInv(gs, ls, E6), pre(gs, ls, E6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E6, seq: ⊦ pcstepf(gs, ls, E6, a) = E7, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 682 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E6, a) = E7

A spec-lemma

Proof step 683 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, DMSQGInv(gs), DMSQLInv(gs, ls, E6), pre(gs, ls, E6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E6-E7, seq:⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7 → ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ ( lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ ( gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok (gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv (gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv (gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs [gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs (gstepf(gs, ls, E6, a).vs [gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E6, a).vs [gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E6, a).vs [gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ ( gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = ( gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast ).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E6, a).vs [(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid (lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid (lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns (lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 684 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7 → ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ (lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ (gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps)

Lemma step-E6-E7

Proof step 685 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, DMSQGInv(gs), DMSQLInv(gs, ls, E6), pre(gs, ls, E6, a), ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7 → ( gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid) ∧ lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl ∧ (lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next) ∧ (gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst)) ∧ ( listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns) ∧ ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps) ∧ markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs) ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps) ∧ gstepf(gs, ls, E6, a).orl ≠ [] ∧ gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl ∧ rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns) ∧ allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp) ∧ dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp ∧ ( gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs)) ∧ ( gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps ∧ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs ∧ lstepf(gs, ls, E6, a).node ≠ null ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl ∧ ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl) ∧ gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null) ∧ gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] ∧ ¬ lstepf(gs, ls, E6, a).success ∧ nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs) ∧ oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 686 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, DMSQGInv(gs), DMSQLInv(gs, ls, E6), pre(gs, ls, E6, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 687 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 688 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, gs.orl ≠ [], DMSQLInv(gs, ls, E6), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E6, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.ps[ls.lst].next = null → ls.lst = gs.vtail)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E6, a) ∧ pcstepf(gs, ls, E6, a) = E7, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E6], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E6; (s) ⊦ D2 ≠ E6; (s) ⊦ E6 ≠ E17; (s) ⊦ E6 ≠ crashed; (s) ⊦ E6 ≠ idle; (s) ⊦ E6 ≠ ready; (s) ⊦ E1 ≠ E6; (s) ⊦ D7 ≠ E6; (s) ⊦ D32 ≠ E6; (s) ⊦ D33 ≠ E6; (s) ⊦ E4 ≠ E6; (s) ⊦ E6 ≠ E16; (s) ⊦ E6 ≠ E15; (s) ⊦ E6 ≠ E14; (s) ⊦ E6 ≠ E13; (s) ⊦ E6 ≠ E12; (s) ⊦ E6 ≠ E11; (s) ⊦ E6 ≠ E10; (s) ⊦ E6 ≠ E9; (s) ⊦ E6 ≠ E8; (s) ⊦ E6 ≠ E7; (s) ⊦ E5 ≠ E6; (s) ⊦ E3 ≠ E6; (s) ⊦ E2 ≠ E6; (s) ⊦ D34 ≠ E6; (s) ⊦ D31 ≠ E6; (s) ⊦ D30 ≠ E6; (s) ⊦ D29 ≠ E6; (s) ⊦ D28 ≠ E6; (s) ⊦ D27 ≠ E6; (s) ⊦ D26 ≠ E6; (s) ⊦ D25 ≠ E6; (s) ⊦ D24 ≠ E6; (s) ⊦ D23 ≠ E6; (s) ⊦ D22 ≠ E6; (s) ⊦ D21 ≠ E6; (s) ⊦ D20 ≠ E6; (s) ⊦ D19 ≠ E6; (s) ⊦ D18 ≠ E6; (s) ⊦ D17 ≠ E6; (s) ⊦ D16 ≠ E6; (s) ⊦ D15 ≠ E6; (s) ⊦ D14 ≠ E6; (s) ⊦ D13 ≠ E6; (s) ⊦ D12 ≠ E6; (s) ⊦ D11 ≠ E6; (s) ⊦ D10 ≠ E6; (s) ⊦ D9 ≠ E6; (s) ⊦ D8 ≠ E6; (s) ⊦ D6 ≠ E6; (s) ⊦ D5 ≠ E6; (s) ⊦ D4 ≠ E6; (s) ⊦ D3 ≠ E6; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E6, a) = E7; (s) Used terms: gs, ls, E6

Proof step 689 from proof copied-step-DMSQLInv (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 690 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid), gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null), gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node], dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp, gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, lstepf(gs, ls, E6, a).node ≠ null, gstepf(gs, ls, E6, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E6), allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp), allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp), listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns), markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps), markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs), nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs), noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs), nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs), oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps), pre(gs, ls, E6, a), rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns), rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns), unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps), lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl, lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps, lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs, ¬ lstepf(gs, ls, E6, a).success, ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl), ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl, ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl, lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next, gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val), gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs), gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 691 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 692 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E6, a).owns(lstepf(gs, ls, E6, a).node) = Some(lstepf(gs, ls, E6, a).tid), gstepf(gs, ls, E6, a).ps[lstepf(gs, ls, E6, a).node] = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node], gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).node] = mk(lstepf(gs, ls, E6, a).value, None, null), dom gstepf(gs, ls, E6, a).vrvHp = dom gstepf(gs, ls, E6, a).prvHp, gs0 = gstepf(gs, ls, E6, a), ls0 = lstepf(gs, ls, E6, a), pc0 = E7, lstepf(gs, ls, E6, a).node ≠ null, gstepf(gs, ls, E6, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E6), allocrv(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp), allocrv(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp), listp(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).owns), markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs), markedp(gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).ps), nextnottid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs), noid(lstepf(gs, ls, E6, a).tid, gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vhead, gstepf(gs, ls, E6, a).vs), nonullRetRefs (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).pretRefs), oneowns(lstepf(gs, ls, E6, a).tid, lstepf(gs, ls, E6, a).node, gstepf(gs, ls, E6, a).owns, gstepf(gs, ls, E6, a).vs, gstepf(gs, ls, E6, a).ps), pre(gs, ls, E6, a), rvownerok(gstepf(gs, ls, E6, a).pretRefs, gstepf(gs, ls, E6, a).prvHp, gstepf(gs, ls, E6, a).rvowns), rvownerok(gstepf(gs, ls, E6, a).vretRefs, gstepf(gs, ls, E6, a).vrvHp, gstepf(gs, ls, E6, a).rvowns), unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).ps), lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).vs, lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).ps, gstepf(gs, ls, E6, a).phead ∈ gstepf(gs, ls, E6, a).orl, lstepf(gs, ls, E6, a).lst ∈ gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl, ¬ lstepf(gs, ls, E6, a).success, ¬ dups(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl), ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).qrl, ¬ lstepf(gs, ls, E6, a).node ∈ gstepf(gs, ls, E6, a).orl, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next ≠ null ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E6, a).rvowns (gstepf(gs, ls, E6, a).vretRefs(gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].deqID.tid, gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).vhead].next].val), gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next = null → gstepf(gs, ls, E6, a).vtail = lstepf(gs, ls, E6, a).lst, lstepf(gs, ls, E6, a).nxt ≠ null → lstepf(gs, ls, E6, a).nxt = gstepf(gs, ls, E6, a).vs[lstepf(gs, ls, E6, a).lst].next, gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last ∨ gstepf(gs, ls, E6, a).qrl ≠ [] ∧ gstepf(gs, ls, E6, a).vtail = (gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl.butlast).last ∧ gstepf(gs, ls, E6, a).vs[gstepf(gs, ls, E6, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E6, a).vs[(gstepf(gs, ls, E6, a).orl + gstepf(gs, ls, E6, a).qrl).last].next = null, gstepf(gs, ls, E6, a).orl.last = gstepf(gs, ls, E6, a).vhead ∧ (gstepf(gs, ls, E6, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E6, a).qrl.tail, gstepf(gs, ls, E6, a).vs)) ∨ gstepf(gs, ls, E6, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E6, a).orl.butlast.last = gstepf(gs, ls, E6, a).vhead ∧ gstepf(gs, ls, E6, a).phead ≠ gstepf(gs, ls, E6, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E6, a).qrl, gstepf(gs, ls, E6, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E6, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E7 ≠ E8; (s) ⊦ E7 ≠ E9; (s) ⊦ E7 ≠ E13; (s) ⊦ E7 ≠ E14; (s) ⊦ E7 ≠ E15; (s) ⊦ E7 ≠ E16; (s) ⊦ E7 ≠ crashed; (s) ⊦ E7 ≠ idle; (s) ⊦ E7 ≠ ready; (s) ⊦ D1 ≠ E7; (s) ⊦ D2 ≠ E7; (s) ⊦ D3 ≠ E7; (s) ⊦ D4 ≠ E7; (s) ⊦ D5 ≠ E7; (s) ⊦ D6 ≠ E7; (s) ⊦ D7 ≠ E7; (s) ⊦ D8 ≠ E7; (s) ⊦ D9 ≠ E7; (s) ⊦ D10 ≠ E7; (s) ⊦ D11 ≠ E7; (s) ⊦ D12 ≠ E7; (s) ⊦ D13 ≠ E7; (s) ⊦ D14 ≠ E7; (s) ⊦ D15 ≠ E7; (s) ⊦ D16 ≠ E7; (s) ⊦ D17 ≠ E7; (s) ⊦ D18 ≠ E7; (s) ⊦ D19 ≠ E7; (s) ⊦ D20 ≠ E7; (s) ⊦ D21 ≠ E7; (s) ⊦ D22 ≠ E7; (s) ⊦ D23 ≠ E7; (s) ⊦ D24 ≠ E7; (s) ⊦ D25 ≠ E7; (s) ⊦ D26 ≠ E7; (s) ⊦ D27 ≠ E7; (s) ⊦ D28 ≠ E7; (s) ⊦ D29 ≠ E7; (s) ⊦ D30 ≠ E7; (s) ⊦ D31 ≠ E7; (s) ⊦ D32 ≠ E7; (s) ⊦ D33 ≠ E7; (s) ⊦ D34 ≠ E7; (s) ⊦ E1 ≠ E7; (s) ⊦ E7 ≠ E12; (s) ⊦ E7 ≠ E17; (s) ⊦ E2 ≠ E7; (s) ⊦ E3 ≠ E7; (s) ⊦ E5 ≠ E7; (s) ⊦ E6 ≠ E7; (s) ⊦ E7 ≠ E10; (s) ⊦ E7 ≠ E11; (s) ⊦ E4 ≠ E7; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (ls.nxt:= node1).node = ls.node; (s) ⊦ (ls.nxt:= node1).value = ls.value; (s) ⊦ gstepf(gs, ls, E6, τ) = gs; (s) ⊦ lstepf(gs, ls, E6, τ) = ls.nxt:= (gs.ps ⊕ gs.vs)[ls.lst].next; (s) ⊦ (ls.nxt:= node1).tid = ls.tid; (s) Used terms: gs0, ls0, pc0

Proof step 693 from proof copied-step-DMSQLInv (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 694 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E7, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 695 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = pcstepf(gs, ls, E7, a), DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E7, seq: ⊦ pcstepf(gs, ls, E7, a) = (ls.lst = gs.vtail ⊃ E8;E16), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 696 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E7, a) = (ls.lst = gs.vtail ⊃ E8;E16)

A spec-lemma

Proof step 697 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = (ls.lst = gs.vtail ⊃ E8;E16), DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 698 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E7-E8, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E8 → ( gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ lstepf(gs, ls, E7, a).lst ∈ gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl ∧ ( lstepf(gs, ls, E7, a).nxt ≠ null → lstepf(gs, ls, E7, a).nxt = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next) ∧ ( gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next = null → gstepf(gs, ls, E7, a).vtail = lstepf(gs, ls, E7, a).lst)) ∧ ( listp (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok (gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv (gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv (gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs (gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ ( gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = ( gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast ).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E7, a).vs [(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid (lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid (lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns (lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 699 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E8 → ( gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ lstepf(gs, ls, E7, a).lst ∈ gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl ∧ (lstepf(gs, ls, E7, a).nxt ≠ null → lstepf(gs, ls, E7, a).nxt = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next) ∧ (gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next = null → gstepf(gs, ls, E7, a).vtail = lstepf(gs, ls, E7, a).lst)) ∧ ( listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps)

Lemma step-E7-E8

Proof step 700 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E8 → ( gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ lstepf(gs, ls, E7, a).lst ∈ gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl ∧ (lstepf(gs, ls, E7, a).nxt ≠ null → lstepf(gs, ls, E7, a).nxt = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next) ∧ (gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next = null → gstepf(gs, ls, E7, a).vtail = lstepf(gs, ls, E7, a).lst)) ∧ ( listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 701 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E8

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 702 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 703 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, gs.orl ≠ [], DMSQLInv(gs, ls, E7), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E7, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E8, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E7], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E7; (s) ⊦ D2 ≠ E7; (s) ⊦ E7 ≠ E17; (s) ⊦ E7 ≠ crashed; (s) ⊦ E7 ≠ idle; (s) ⊦ E7 ≠ ready; (s) ⊦ E1 ≠ E7; (s) ⊦ D7 ≠ E7; (s) ⊦ D32 ≠ E7; (s) ⊦ D33 ≠ E7; (s) ⊦ E4 ≠ E7; (s) ⊦ E7 ≠ E16; (s) ⊦ E7 ≠ E15; (s) ⊦ E7 ≠ E14; (s) ⊦ E7 ≠ E13; (s) ⊦ E7 ≠ E12; (s) ⊦ E7 ≠ E11; (s) ⊦ E7 ≠ E10; (s) ⊦ E7 ≠ E9; (s) ⊦ E7 ≠ E8; (s) ⊦ E6 ≠ E7; (s) ⊦ E5 ≠ E7; (s) ⊦ E3 ≠ E7; (s) ⊦ E2 ≠ E7; (s) ⊦ D34 ≠ E7; (s) ⊦ D31 ≠ E7; (s) ⊦ D30 ≠ E7; (s) ⊦ D29 ≠ E7; (s) ⊦ D28 ≠ E7; (s) ⊦ D27 ≠ E7; (s) ⊦ D26 ≠ E7; (s) ⊦ D25 ≠ E7; (s) ⊦ D24 ≠ E7; (s) ⊦ D23 ≠ E7; (s) ⊦ D22 ≠ E7; (s) ⊦ D21 ≠ E7; (s) ⊦ D20 ≠ E7; (s) ⊦ D19 ≠ E7; (s) ⊦ D18 ≠ E7; (s) ⊦ D17 ≠ E7; (s) ⊦ D16 ≠ E7; (s) ⊦ D15 ≠ E7; (s) ⊦ D14 ≠ E7; (s) ⊦ D13 ≠ E7; (s) ⊦ D12 ≠ E7; (s) ⊦ D11 ≠ E7; (s) ⊦ D10 ≠ E7; (s) ⊦ D9 ≠ E7; (s) ⊦ D8 ≠ E7; (s) ⊦ D6 ≠ E7; (s) ⊦ D5 ≠ E7; (s) ⊦ D4 ≠ E7; (s) ⊦ D3 ≠ E7; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E7, a) = (ls.lst = gs.vtail ⊃ E8;E16); (s) Used terms: gs, ls, E7

Proof step 704 from proof copied-step-DMSQLInv (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 705 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid), gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null), gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node], dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, lstepf(gs, ls, E7, a).node ≠ null, gstepf(gs, ls, E7, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E7), allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp), allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp), listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs), nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs), oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), pre(gs, ls, E7, a), rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns), rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns), unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps), lstepf(gs, ls, E7, a).lst ∈ gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs, ¬ lstepf(gs, ls, E7, a).success, ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl), ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl, ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl, lstepf(gs, ls, E7, a).nxt ≠ null → lstepf(gs, ls, E7, a).nxt = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next, gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next = null → gstepf(gs, ls, E7, a).vtail = lstepf(gs, ls, E7, a).lst, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val), gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs), gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 706 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 707 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.lst = gs.vtail, gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid), gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node], gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null), dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E8, lstepf(gs, ls, E7, a).node ≠ null, gstepf(gs, ls, E7, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E7), allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp), allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp), listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps), nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs), oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), pre(gs, ls, E7, a), rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns), rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns), unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps), lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl, lstepf(gs, ls, E7, a).lst ∈ gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, ¬ lstepf(gs, ls, E7, a).success, ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl), ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl, ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val), gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next = null → gstepf(gs, ls, E7, a).vtail = lstepf(gs, ls, E7, a).lst, lstepf(gs, ls, E7, a).nxt ≠ null → lstepf(gs, ls, E7, a).nxt = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).lst].next, gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null, gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E8 ≠ E9; (s) ⊦ E8 ≠ E13; (s) ⊦ E8 ≠ E14; (s) ⊦ E8 ≠ E15; (s) ⊦ E8 ≠ E16; (s) ⊦ E8 ≠ crashed; (s) ⊦ E8 ≠ idle; (s) ⊦ E8 ≠ ready; (s) ⊦ D1 ≠ E8; (s) ⊦ D2 ≠ E8; (s) ⊦ D3 ≠ E8; (s) ⊦ D4 ≠ E8; (s) ⊦ D5 ≠ E8; (s) ⊦ D6 ≠ E8; (s) ⊦ D7 ≠ E8; (s) ⊦ D8 ≠ E8; (s) ⊦ D9 ≠ E8; (s) ⊦ D10 ≠ E8; (s) ⊦ D11 ≠ E8; (s) ⊦ D12 ≠ E8; (s) ⊦ D13 ≠ E8; (s) ⊦ D14 ≠ E8; (s) ⊦ D15 ≠ E8; (s) ⊦ D16 ≠ E8; (s) ⊦ D17 ≠ E8; (s) ⊦ D18 ≠ E8; (s) ⊦ D19 ≠ E8; (s) ⊦ D20 ≠ E8; (s) ⊦ D21 ≠ E8; (s) ⊦ D22 ≠ E8; (s) ⊦ D23 ≠ E8; (s) ⊦ D24 ≠ E8; (s) ⊦ D25 ≠ E8; (s) ⊦ D26 ≠ E8; (s) ⊦ D27 ≠ E8; (s) ⊦ D28 ≠ E8; (s) ⊦ D29 ≠ E8; (s) ⊦ D30 ≠ E8; (s) ⊦ D31 ≠ E8; (s) ⊦ D32 ≠ E8; (s) ⊦ D33 ≠ E8; (s) ⊦ D34 ≠ E8; (s) ⊦ E1 ≠ E8; (s) ⊦ E8 ≠ E12; (s) ⊦ E8 ≠ E17; (s) ⊦ E2 ≠ E8; (s) ⊦ E3 ≠ E8; (s) ⊦ E5 ≠ E8; (s) ⊦ E6 ≠ E8; (s) ⊦ E7 ≠ E8; (s) ⊦ E8 ≠ E10; (s) ⊦ E8 ≠ E11; (s) ⊦ E4 ≠ E8; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E7, τ) = gs; (s) ⊦ lstepf(gs, ls, E7, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 708 from proof copied-step-DMSQLInv (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 709 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E7-E16, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E16 → gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ ( listp (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok (gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv (gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv (gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs (gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E7, a).vs [gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ ( gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = ( gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast ).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E7, a).vs [(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid (lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid (lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns (lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 710 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E16 → gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ ( listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps)

Lemma step-E7-E16

Proof step 711 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E16 → gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid) ∧ ( listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns) ∧ ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps) ∧ markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs) ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps) ∧ gstepf(gs, ls, E7, a).orl ≠ [] ∧ gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl ∧ rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns) ∧ allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp) ∧ dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp ∧ ( gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs)) ∧ ( gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps ∧ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs ∧ lstepf(gs, ls, E7, a).node ≠ null ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl ∧ ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl) ∧ gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null) ∧ gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] ∧ ¬ lstepf(gs, ls, E7, a).success ∧ nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs) ∧ oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 712 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, DMSQGInv(gs), DMSQLInv(gs, ls, E7), pre(gs, ls, E7, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E16

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 713 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 714 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, gs.orl ≠ [], DMSQLInv(gs, ls, E7), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E7, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E7, a) ∧ pcstepf(gs, ls, E7, a) = E16, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E7], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E7; (s) ⊦ D2 ≠ E7; (s) ⊦ E7 ≠ E17; (s) ⊦ E7 ≠ crashed; (s) ⊦ E7 ≠ idle; (s) ⊦ E7 ≠ ready; (s) ⊦ E1 ≠ E7; (s) ⊦ D7 ≠ E7; (s) ⊦ D32 ≠ E7; (s) ⊦ D33 ≠ E7; (s) ⊦ E4 ≠ E7; (s) ⊦ E7 ≠ E16; (s) ⊦ E7 ≠ E15; (s) ⊦ E7 ≠ E14; (s) ⊦ E7 ≠ E13; (s) ⊦ E7 ≠ E12; (s) ⊦ E7 ≠ E11; (s) ⊦ E7 ≠ E10; (s) ⊦ E7 ≠ E9; (s) ⊦ E7 ≠ E8; (s) ⊦ E6 ≠ E7; (s) ⊦ E5 ≠ E7; (s) ⊦ E3 ≠ E7; (s) ⊦ E2 ≠ E7; (s) ⊦ D34 ≠ E7; (s) ⊦ D31 ≠ E7; (s) ⊦ D30 ≠ E7; (s) ⊦ D29 ≠ E7; (s) ⊦ D28 ≠ E7; (s) ⊦ D27 ≠ E7; (s) ⊦ D26 ≠ E7; (s) ⊦ D25 ≠ E7; (s) ⊦ D24 ≠ E7; (s) ⊦ D23 ≠ E7; (s) ⊦ D22 ≠ E7; (s) ⊦ D21 ≠ E7; (s) ⊦ D20 ≠ E7; (s) ⊦ D19 ≠ E7; (s) ⊦ D18 ≠ E7; (s) ⊦ D17 ≠ E7; (s) ⊦ D16 ≠ E7; (s) ⊦ D15 ≠ E7; (s) ⊦ D14 ≠ E7; (s) ⊦ D13 ≠ E7; (s) ⊦ D12 ≠ E7; (s) ⊦ D11 ≠ E7; (s) ⊦ D10 ≠ E7; (s) ⊦ D9 ≠ E7; (s) ⊦ D8 ≠ E7; (s) ⊦ D6 ≠ E7; (s) ⊦ D5 ≠ E7; (s) ⊦ D4 ≠ E7; (s) ⊦ D3 ≠ E7; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E7, a) = (ls.lst = gs.vtail ⊃ E8;E16); (s) Used terms: gs, ls, E7

Proof step 715 from proof copied-step-DMSQLInv (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 716 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid), gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null), gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node], dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, lstepf(gs, ls, E7, a).node ≠ null, gstepf(gs, ls, E7, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E7), allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp), allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp), listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs), nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs), oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), pre(gs, ls, E7, a), rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns), rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns), unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps), gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs, ¬ lstepf(gs, ls, E7, a).success, ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl), ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl, ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val), gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs), gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 717 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 718 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E7, a).owns(lstepf(gs, ls, E7, a).node) = Some(lstepf(gs, ls, E7, a).tid), gstepf(gs, ls, E7, a).ps[lstepf(gs, ls, E7, a).node] = gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node], gstepf(gs, ls, E7, a).vs[lstepf(gs, ls, E7, a).node] = mk(lstepf(gs, ls, E7, a).value, None, null), dom gstepf(gs, ls, E7, a).vrvHp = dom gstepf(gs, ls, E7, a).prvHp, gs0 = gstepf(gs, ls, E7, a), ls0 = lstepf(gs, ls, E7, a), pc0 = E16, ls.lst ≠ gs.vtail, lstepf(gs, ls, E7, a).node ≠ null, gstepf(gs, ls, E7, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E7), allocrv(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp), allocrv(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp), listp(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).owns), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs), markedp(gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).ps), nextnottid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), noid(lstepf(gs, ls, E7, a).tid, gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vhead, gstepf(gs, ls, E7, a).vs), nonullRetRefs (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).pretRefs), oneowns(lstepf(gs, ls, E7, a).tid, lstepf(gs, ls, E7, a).node, gstepf(gs, ls, E7, a).owns, gstepf(gs, ls, E7, a).vs, gstepf(gs, ls, E7, a).ps), pre(gs, ls, E7, a), rvownerok(gstepf(gs, ls, E7, a).pretRefs, gstepf(gs, ls, E7, a).prvHp, gstepf(gs, ls, E7, a).rvowns), rvownerok(gstepf(gs, ls, E7, a).vretRefs, gstepf(gs, ls, E7, a).vrvHp, gstepf(gs, ls, E7, a).rvowns), unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).ps), lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).vs, lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).ps, gstepf(gs, ls, E7, a).phead ∈ gstepf(gs, ls, E7, a).orl, ¬ lstepf(gs, ls, E7, a).success, ¬ dups(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl), ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).qrl, ¬ lstepf(gs, ls, E7, a).node ∈ gstepf(gs, ls, E7, a).orl, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next ≠ null ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E7, a).rvowns (gstepf(gs, ls, E7, a).vretRefs(gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].deqID.tid, gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).vhead].next].val), gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last ∨ gstepf(gs, ls, E7, a).qrl ≠ [] ∧ gstepf(gs, ls, E7, a).vtail = (gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl.butlast).last ∧ gstepf(gs, ls, E7, a).vs[gstepf(gs, ls, E7, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E7, a).vs[(gstepf(gs, ls, E7, a).orl + gstepf(gs, ls, E7, a).qrl).last].next = null, gstepf(gs, ls, E7, a).orl.last = gstepf(gs, ls, E7, a).vhead ∧ (gstepf(gs, ls, E7, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E7, a).qrl.tail, gstepf(gs, ls, E7, a).vs)) ∨ gstepf(gs, ls, E7, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E7, a).orl.butlast.last = gstepf(gs, ls, E7, a).vhead ∧ gstepf(gs, ls, E7, a).phead ≠ gstepf(gs, ls, E7, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E7, a).qrl, gstepf(gs, ls, E7, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E7, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E16 ≠ crashed; (s) ⊦ E16 ≠ idle; (s) ⊦ E16 ≠ ready; (s) ⊦ D1 ≠ E16; (s) ⊦ D2 ≠ E16; (s) ⊦ D3 ≠ E16; (s) ⊦ D4 ≠ E16; (s) ⊦ D5 ≠ E16; (s) ⊦ D6 ≠ E16; (s) ⊦ D7 ≠ E16; (s) ⊦ D8 ≠ E16; (s) ⊦ D9 ≠ E16; (s) ⊦ D10 ≠ E16; (s) ⊦ D11 ≠ E16; (s) ⊦ D12 ≠ E16; (s) ⊦ D13 ≠ E16; (s) ⊦ D14 ≠ E16; (s) ⊦ D15 ≠ E16; (s) ⊦ D16 ≠ E16; (s) ⊦ D17 ≠ E16; (s) ⊦ D18 ≠ E16; (s) ⊦ D19 ≠ E16; (s) ⊦ D20 ≠ E16; (s) ⊦ D21 ≠ E16; (s) ⊦ D22 ≠ E16; (s) ⊦ D23 ≠ E16; (s) ⊦ D24 ≠ E16; (s) ⊦ D25 ≠ E16; (s) ⊦ D26 ≠ E16; (s) ⊦ D27 ≠ E16; (s) ⊦ D28 ≠ E16; (s) ⊦ D29 ≠ E16; (s) ⊦ D30 ≠ E16; (s) ⊦ D31 ≠ E16; (s) ⊦ D32 ≠ E16; (s) ⊦ D33 ≠ E16; (s) ⊦ D34 ≠ E16; (s) ⊦ E1 ≠ E16; (s) ⊦ E12 ≠ E16; (s) ⊦ E16 ≠ E17; (s) ⊦ E2 ≠ E16; (s) ⊦ E3 ≠ E16; (s) ⊦ E5 ≠ E16; (s) ⊦ E6 ≠ E16; (s) ⊦ E7 ≠ E16; (s) ⊦ E8 ≠ E16; (s) ⊦ E9 ≠ E16; (s) ⊦ E13 ≠ E16; (s) ⊦ E14 ≠ E16; (s) ⊦ E15 ≠ E16; (s) ⊦ E10 ≠ E16; (s) ⊦ E11 ≠ E16; (s) ⊦ E4 ≠ E16; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E7, τ) = gs; (s) ⊦ lstepf(gs, ls, E7, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 719 from proof copied-step-DMSQLInv (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 720 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E8, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 721 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = pcstepf(gs, ls, E8, a), DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E8, seq: ⊦ pcstepf(gs, ls, E8, a) = (ls.nxt = null ⊃ E9;E14), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 722 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E8, a) = (ls.nxt = null ⊃ E9;E14)

A spec-lemma

Proof step 723 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = (ls.nxt = null ⊃ E9;E14), DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 724 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E8-E9, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E9 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).nxt = null ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ ( gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next = null → gstepf(gs, ls, E8, a).vtail = lstepf(gs, ls, E8, a).lst)) ∧ ( listp (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok (gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv (gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv (gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs (gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ ( gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = ( gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast ).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E8, a).vs [(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid (lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid (lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns (lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 725 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E9 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).nxt = null ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ (gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next = null → gstepf(gs, ls, E8, a).vtail = lstepf(gs, ls, E8, a).lst)) ∧ ( listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps)

Lemma step-E8-E9

Proof step 726 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E9 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).nxt = null ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ (gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next = null → gstepf(gs, ls, E8, a).vtail = lstepf(gs, ls, E8, a).lst)) ∧ ( listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 727 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E9

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 728 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 729 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, gs.orl ≠ [], DMSQLInv(gs, ls, E8), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E8, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E9, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E8], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E8; (s) ⊦ D2 ≠ E8; (s) ⊦ E8 ≠ E17; (s) ⊦ E8 ≠ crashed; (s) ⊦ E8 ≠ idle; (s) ⊦ E8 ≠ ready; (s) ⊦ E1 ≠ E8; (s) ⊦ D7 ≠ E8; (s) ⊦ D32 ≠ E8; (s) ⊦ D33 ≠ E8; (s) ⊦ E4 ≠ E8; (s) ⊦ E8 ≠ E16; (s) ⊦ E8 ≠ E15; (s) ⊦ E8 ≠ E14; (s) ⊦ E8 ≠ E13; (s) ⊦ E8 ≠ E12; (s) ⊦ E8 ≠ E11; (s) ⊦ E8 ≠ E10; (s) ⊦ E8 ≠ E9; (s) ⊦ E7 ≠ E8; (s) ⊦ E6 ≠ E8; (s) ⊦ E5 ≠ E8; (s) ⊦ E3 ≠ E8; (s) ⊦ E2 ≠ E8; (s) ⊦ D34 ≠ E8; (s) ⊦ D31 ≠ E8; (s) ⊦ D30 ≠ E8; (s) ⊦ D29 ≠ E8; (s) ⊦ D28 ≠ E8; (s) ⊦ D27 ≠ E8; (s) ⊦ D26 ≠ E8; (s) ⊦ D25 ≠ E8; (s) ⊦ D24 ≠ E8; (s) ⊦ D23 ≠ E8; (s) ⊦ D22 ≠ E8; (s) ⊦ D21 ≠ E8; (s) ⊦ D20 ≠ E8; (s) ⊦ D19 ≠ E8; (s) ⊦ D18 ≠ E8; (s) ⊦ D17 ≠ E8; (s) ⊦ D16 ≠ E8; (s) ⊦ D15 ≠ E8; (s) ⊦ D14 ≠ E8; (s) ⊦ D13 ≠ E8; (s) ⊦ D12 ≠ E8; (s) ⊦ D11 ≠ E8; (s) ⊦ D10 ≠ E8; (s) ⊦ D9 ≠ E8; (s) ⊦ D8 ≠ E8; (s) ⊦ D6 ≠ E8; (s) ⊦ D5 ≠ E8; (s) ⊦ D4 ≠ E8; (s) ⊦ D3 ≠ E8; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E8, a) = (ls.nxt = null ⊃ E9;E14); (s) Used terms: gs, ls, E8

Proof step 730 from proof copied-step-DMSQLInv (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 731 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls.nxt = null, lstepf(gs, ls, E8, a).nxt = null, gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid), gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null), gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node], dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, lstepf(gs, ls, E8, a).node ≠ null, gstepf(gs, ls, E8, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E8), allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp), allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp), listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs), nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs), oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), pre(gs, ls, E8, a), rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns), rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns), unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps), lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs, ¬ lstepf(gs, ls, E8, a).success, ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl), ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next = null → gstepf(gs, ls, E8, a).vtail = lstepf(gs, ls, E8, a).lst, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val), gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs), gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 732 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 733 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, E8, a).nxt = null, ls.nxt = null, gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid), gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node], gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null), dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E9, lstepf(gs, ls, E8, a).node ≠ null, gstepf(gs, ls, E8, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E8), allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp), allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp), listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps), nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs), oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), pre(gs, ls, E8, a), rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns), rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns), unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps), lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl, lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).success, ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl), ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val), gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next = null → gstepf(gs, ls, E8, a).vtail = lstepf(gs, ls, E8, a).lst, gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null, gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E9 ≠ E13; (s) ⊦ E9 ≠ E14; (s) ⊦ E9 ≠ E15; (s) ⊦ E9 ≠ E16; (s) ⊦ E9 ≠ crashed; (s) ⊦ E9 ≠ idle; (s) ⊦ E9 ≠ ready; (s) ⊦ D1 ≠ E9; (s) ⊦ D2 ≠ E9; (s) ⊦ D3 ≠ E9; (s) ⊦ D4 ≠ E9; (s) ⊦ D5 ≠ E9; (s) ⊦ D6 ≠ E9; (s) ⊦ D7 ≠ E9; (s) ⊦ D8 ≠ E9; (s) ⊦ D9 ≠ E9; (s) ⊦ D10 ≠ E9; (s) ⊦ D11 ≠ E9; (s) ⊦ D12 ≠ E9; (s) ⊦ D13 ≠ E9; (s) ⊦ D14 ≠ E9; (s) ⊦ D15 ≠ E9; (s) ⊦ D16 ≠ E9; (s) ⊦ D17 ≠ E9; (s) ⊦ D18 ≠ E9; (s) ⊦ D19 ≠ E9; (s) ⊦ D20 ≠ E9; (s) ⊦ D21 ≠ E9; (s) ⊦ D22 ≠ E9; (s) ⊦ D23 ≠ E9; (s) ⊦ D24 ≠ E9; (s) ⊦ D25 ≠ E9; (s) ⊦ D26 ≠ E9; (s) ⊦ D27 ≠ E9; (s) ⊦ D28 ≠ E9; (s) ⊦ D29 ≠ E9; (s) ⊦ D30 ≠ E9; (s) ⊦ D31 ≠ E9; (s) ⊦ D32 ≠ E9; (s) ⊦ D33 ≠ E9; (s) ⊦ D34 ≠ E9; (s) ⊦ E1 ≠ E9; (s) ⊦ E9 ≠ E12; (s) ⊦ E9 ≠ E17; (s) ⊦ E2 ≠ E9; (s) ⊦ E3 ≠ E9; (s) ⊦ E5 ≠ E9; (s) ⊦ E6 ≠ E9; (s) ⊦ E7 ≠ E9; (s) ⊦ E8 ≠ E9; (s) ⊦ E9 ≠ E10; (s) ⊦ E9 ≠ E11; (s) ⊦ E4 ≠ E9; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E8, τ) = gs; (s) ⊦ lstepf(gs, ls, E8, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 734 from proof copied-step-DMSQLInv (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 735 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E8-E14, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E14 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ lstepf(gs, ls, E8, a).nxt = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next ∧ lstepf(gs, ls, E8, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok (gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv (gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv (gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs (gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E8, a).vs [gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ ( gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = ( gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast ).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E8, a).vs [(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid (lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid (lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns (lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 736 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E14 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ lstepf(gs, ls, E8, a).nxt = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next ∧ lstepf(gs, ls, E8, a).nxt ≠ null) ∧ ( listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps)

Lemma step-E8-E14

Proof step 737 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E14 → ( gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid) ∧ lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl ∧ lstepf(gs, ls, E8, a).nxt = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next ∧ lstepf(gs, ls, E8, a).nxt ≠ null) ∧ ( listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns) ∧ ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps) ∧ markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs) ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps) ∧ gstepf(gs, ls, E8, a).orl ≠ [] ∧ gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl ∧ rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns) ∧ allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp) ∧ dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp ∧ ( gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs)) ∧ ( gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps ∧ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs ∧ lstepf(gs, ls, E8, a).node ≠ null ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl ∧ ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl) ∧ gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null) ∧ gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] ∧ ¬ lstepf(gs, ls, E8, a).success ∧ nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs) ∧ oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 738 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, ls.nxt ≠ null, DMSQGInv(gs), DMSQLInv(gs, ls, E8), pre(gs, ls, E8, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E14

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 739 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 740 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, ls.nxt ≠ null, gs.orl ≠ [], DMSQLInv(gs, ls, E8), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E8, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E8, a) ∧ pcstepf(gs, ls, E8, a) = E14, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E8], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E8; (s) ⊦ D2 ≠ E8; (s) ⊦ E8 ≠ E17; (s) ⊦ E8 ≠ crashed; (s) ⊦ E8 ≠ idle; (s) ⊦ E8 ≠ ready; (s) ⊦ E1 ≠ E8; (s) ⊦ D7 ≠ E8; (s) ⊦ D32 ≠ E8; (s) ⊦ D33 ≠ E8; (s) ⊦ E4 ≠ E8; (s) ⊦ E8 ≠ E16; (s) ⊦ E8 ≠ E15; (s) ⊦ E8 ≠ E14; (s) ⊦ E8 ≠ E13; (s) ⊦ E8 ≠ E12; (s) ⊦ E8 ≠ E11; (s) ⊦ E8 ≠ E10; (s) ⊦ E8 ≠ E9; (s) ⊦ E7 ≠ E8; (s) ⊦ E6 ≠ E8; (s) ⊦ E5 ≠ E8; (s) ⊦ E3 ≠ E8; (s) ⊦ E2 ≠ E8; (s) ⊦ D34 ≠ E8; (s) ⊦ D31 ≠ E8; (s) ⊦ D30 ≠ E8; (s) ⊦ D29 ≠ E8; (s) ⊦ D28 ≠ E8; (s) ⊦ D27 ≠ E8; (s) ⊦ D26 ≠ E8; (s) ⊦ D25 ≠ E8; (s) ⊦ D24 ≠ E8; (s) ⊦ D23 ≠ E8; (s) ⊦ D22 ≠ E8; (s) ⊦ D21 ≠ E8; (s) ⊦ D20 ≠ E8; (s) ⊦ D19 ≠ E8; (s) ⊦ D18 ≠ E8; (s) ⊦ D17 ≠ E8; (s) ⊦ D16 ≠ E8; (s) ⊦ D15 ≠ E8; (s) ⊦ D14 ≠ E8; (s) ⊦ D13 ≠ E8; (s) ⊦ D12 ≠ E8; (s) ⊦ D11 ≠ E8; (s) ⊦ D10 ≠ E8; (s) ⊦ D9 ≠ E8; (s) ⊦ D8 ≠ E8; (s) ⊦ D6 ≠ E8; (s) ⊦ D5 ≠ E8; (s) ⊦ D4 ≠ E8; (s) ⊦ D3 ≠ E8; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E8, a) = (ls.nxt = null ⊃ E9;E14); (s) Used terms: gs, ls, E8

Proof step 741 from proof copied-step-DMSQLInv (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 742 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, E8, a).nxt = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next, gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid), gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null), gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node], dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, lstepf(gs, ls, E8, a).node ≠ null, lstepf(gs, ls, E8, a).nxt ≠ null, ls.nxt ≠ null, gstepf(gs, ls, E8, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E8), allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp), allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp), listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs), nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs), oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), pre(gs, ls, E8, a), rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns), rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns), unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps), lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs, ¬ lstepf(gs, ls, E8, a).success, ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl), ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val), gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs), gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 743 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 744 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, E8, a).nxt = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).lst].next, gstepf(gs, ls, E8, a).owns(lstepf(gs, ls, E8, a).node) = Some(lstepf(gs, ls, E8, a).tid), gstepf(gs, ls, E8, a).ps[lstepf(gs, ls, E8, a).node] = gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node], gstepf(gs, ls, E8, a).vs[lstepf(gs, ls, E8, a).node] = mk(lstepf(gs, ls, E8, a).value, None, null), dom gstepf(gs, ls, E8, a).vrvHp = dom gstepf(gs, ls, E8, a).prvHp, gs0 = gstepf(gs, ls, E8, a), ls0 = lstepf(gs, ls, E8, a), pc0 = E14, lstepf(gs, ls, E8, a).node ≠ null, lstepf(gs, ls, E8, a).nxt ≠ null, ls.nxt ≠ null, gstepf(gs, ls, E8, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E8), allocrv(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp), allocrv(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp), listp(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).owns), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs), markedp(gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).ps), nextnottid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), noid(lstepf(gs, ls, E8, a).tid, gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vhead, gstepf(gs, ls, E8, a).vs), nonullRetRefs (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).pretRefs), oneowns(lstepf(gs, ls, E8, a).tid, lstepf(gs, ls, E8, a).node, gstepf(gs, ls, E8, a).owns, gstepf(gs, ls, E8, a).vs, gstepf(gs, ls, E8, a).ps), pre(gs, ls, E8, a), rvownerok(gstepf(gs, ls, E8, a).pretRefs, gstepf(gs, ls, E8, a).prvHp, gstepf(gs, ls, E8, a).rvowns), rvownerok(gstepf(gs, ls, E8, a).vretRefs, gstepf(gs, ls, E8, a).vrvHp, gstepf(gs, ls, E8, a).rvowns), unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).ps), lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).vs, lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).ps, gstepf(gs, ls, E8, a).phead ∈ gstepf(gs, ls, E8, a).orl, lstepf(gs, ls, E8, a).lst ∈ gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).success, ¬ dups(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl), ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).qrl, ¬ lstepf(gs, ls, E8, a).node ∈ gstepf(gs, ls, E8, a).orl, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next ≠ null ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E8, a).rvowns (gstepf(gs, ls, E8, a).vretRefs(gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].deqID.tid, gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).vhead].next].val), gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last ∨ gstepf(gs, ls, E8, a).qrl ≠ [] ∧ gstepf(gs, ls, E8, a).vtail = (gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl.butlast).last ∧ gstepf(gs, ls, E8, a).vs[gstepf(gs, ls, E8, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E8, a).vs[(gstepf(gs, ls, E8, a).orl + gstepf(gs, ls, E8, a).qrl).last].next = null, gstepf(gs, ls, E8, a).orl.last = gstepf(gs, ls, E8, a).vhead ∧ (gstepf(gs, ls, E8, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E8, a).qrl.tail, gstepf(gs, ls, E8, a).vs)) ∨ gstepf(gs, ls, E8, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E8, a).orl.butlast.last = gstepf(gs, ls, E8, a).vhead ∧ gstepf(gs, ls, E8, a).phead ≠ gstepf(gs, ls, E8, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E8, a).qrl, gstepf(gs, ls, E8, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E8, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E14 ≠ E15; (s) ⊦ E14 ≠ E16; (s) ⊦ E14 ≠ crashed; (s) ⊦ E14 ≠ idle; (s) ⊦ E14 ≠ ready; (s) ⊦ D1 ≠ E14; (s) ⊦ D2 ≠ E14; (s) ⊦ D3 ≠ E14; (s) ⊦ D4 ≠ E14; (s) ⊦ D5 ≠ E14; (s) ⊦ D6 ≠ E14; (s) ⊦ D7 ≠ E14; (s) ⊦ D8 ≠ E14; (s) ⊦ D9 ≠ E14; (s) ⊦ D10 ≠ E14; (s) ⊦ D11 ≠ E14; (s) ⊦ D12 ≠ E14; (s) ⊦ D13 ≠ E14; (s) ⊦ D14 ≠ E14; (s) ⊦ D15 ≠ E14; (s) ⊦ D16 ≠ E14; (s) ⊦ D17 ≠ E14; (s) ⊦ D18 ≠ E14; (s) ⊦ D19 ≠ E14; (s) ⊦ D20 ≠ E14; (s) ⊦ D21 ≠ E14; (s) ⊦ D22 ≠ E14; (s) ⊦ D23 ≠ E14; (s) ⊦ D24 ≠ E14; (s) ⊦ D25 ≠ E14; (s) ⊦ D26 ≠ E14; (s) ⊦ D27 ≠ E14; (s) ⊦ D28 ≠ E14; (s) ⊦ D29 ≠ E14; (s) ⊦ D30 ≠ E14; (s) ⊦ D31 ≠ E14; (s) ⊦ D32 ≠ E14; (s) ⊦ D33 ≠ E14; (s) ⊦ D34 ≠ E14; (s) ⊦ E1 ≠ E14; (s) ⊦ E12 ≠ E14; (s) ⊦ E14 ≠ E17; (s) ⊦ E2 ≠ E14; (s) ⊦ E3 ≠ E14; (s) ⊦ E5 ≠ E14; (s) ⊦ E6 ≠ E14; (s) ⊦ E7 ≠ E14; (s) ⊦ E8 ≠ E14; (s) ⊦ E9 ≠ E14; (s) ⊦ E13 ≠ E14; (s) ⊦ E10 ≠ E14; (s) ⊦ E11 ≠ E14; (s) ⊦ E4 ≠ E14; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E8, τ) = gs; (s) ⊦ lstepf(gs, ls, E8, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 745 from proof copied-step-DMSQLInv (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 746 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E9, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 747 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = pcstepf(gs, ls, E9, a), DMSQGInv(gs), DMSQLInv(gs, ls, E9), pre(gs, ls, E9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E9, seq: ⊦ pcstepf(gs, ls, E9, a) = E10, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 748 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E9, a) = E10

A spec-lemma

Proof step 749 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, DMSQGInv(gs), DMSQLInv(gs, ls, E9), pre(gs, ls, E9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E9-E10, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → ( lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node)) ∧ ( listp (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs) ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps) ∧ gstepf(gs, ls, E9, a).orl ≠ [] ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl ∧ rvownerok (gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv (gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv (gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp) ∧ dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp ∧ ( gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs [gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ] .deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs (gstepf(gs, ls, E9, a).vs [gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E9, a).vs [gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E9, a).vs [gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ ( gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs)) ∧ ( gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = ( gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast ).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E9, a).vs [(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node]) ∧ nextnottid (lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ noid (lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ (lstepf(gs, ls, E9, a).success ⊃ ( gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 750 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → ( lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node)) ∧ ( listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs) ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps) ∧ gstepf(gs, ls, E9, a).orl ≠ [] ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl ∧ rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp) ∧ dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp ∧ ( gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs)) ∧ ( gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node]) ∧ nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) )

Lemma step-E9-E10

Proof step 751 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, DMSQGInv(gs), DMSQLInv(gs, ls, E9), pre(gs, ls, E9, a), ( (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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → ( lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node)) ∧ ( listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs) ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps) ∧ gstepf(gs, ls, E9, a).orl ≠ [] ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl ∧ rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp) ∧ dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp ∧ ( gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs)) ∧ ( gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node]) ∧ nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 752 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, DMSQGInv(gs), DMSQLInv(gs, ls, E9), pre(gs, ls, E9, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 753 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 754 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, gs.orl ≠ [], DMSQLInv(gs, ls, E9), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E9, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E9], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E9; (s) ⊦ D2 ≠ E9; (s) ⊦ E9 ≠ E17; (s) ⊦ E9 ≠ crashed; (s) ⊦ E9 ≠ idle; (s) ⊦ E9 ≠ ready; (s) ⊦ E1 ≠ E9; (s) ⊦ D7 ≠ E9; (s) ⊦ D32 ≠ E9; (s) ⊦ D33 ≠ E9; (s) ⊦ E4 ≠ E9; (s) ⊦ E9 ≠ E16; (s) ⊦ E9 ≠ E15; (s) ⊦ E9 ≠ E14; (s) ⊦ E9 ≠ E13; (s) ⊦ E9 ≠ E12; (s) ⊦ E9 ≠ E11; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E9; (s) ⊦ E7 ≠ E9; (s) ⊦ E6 ≠ E9; (s) ⊦ E5 ≠ E9; (s) ⊦ E3 ≠ E9; (s) ⊦ E2 ≠ E9; (s) ⊦ D34 ≠ E9; (s) ⊦ D31 ≠ E9; (s) ⊦ D30 ≠ E9; (s) ⊦ D29 ≠ E9; (s) ⊦ D28 ≠ E9; (s) ⊦ D27 ≠ E9; (s) ⊦ D26 ≠ E9; (s) ⊦ D25 ≠ E9; (s) ⊦ D24 ≠ E9; (s) ⊦ D23 ≠ E9; (s) ⊦ D22 ≠ E9; (s) ⊦ D21 ≠ E9; (s) ⊦ D20 ≠ E9; (s) ⊦ D19 ≠ E9; (s) ⊦ D18 ≠ E9; (s) ⊦ D17 ≠ E9; (s) ⊦ D16 ≠ E9; (s) ⊦ D15 ≠ E9; (s) ⊦ D14 ≠ E9; (s) ⊦ D13 ≠ E9; (s) ⊦ D12 ≠ E9; (s) ⊦ D11 ≠ E9; (s) ⊦ D10 ≠ E9; (s) ⊦ D9 ≠ E9; (s) ⊦ D8 ≠ E9; (s) ⊦ D6 ≠ E9; (s) ⊦ D5 ≠ E9; (s) ⊦ D4 ≠ E9; (s) ⊦ D3 ≠ E9; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E9, a) = E10; (s) Used terms: gs, ls, E9

Proof step 755 from proof copied-step-DMSQLInv (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 756 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp, gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, gstepf(gs, ls, E9, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E9), allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp), allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp), listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs), nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs), pre(gs, ls, E9, a), rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns), rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns), unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps), gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl, ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl), lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node), gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val), ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node], (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ), gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs), gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 757 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 758 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp, gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, gstepf(gs, ls, E9, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E9), allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp), allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp), listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps), nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs), pre(gs, ls, E9, a), rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns), rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns), unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps), gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl, ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl), ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node], gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val), lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node), (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ), gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null, gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used terms: gs0, ls0, pc0

Proof step 759 from proof copied-step-DMSQLInv (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 760 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E11; (s) ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ lstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true ;ls.success:= false ); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ E2 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E9 ≠ E10; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ D3 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ E1 ≠ E10; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E17; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 761 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp, gs0 = gstepf(gs, ls, E9, a), ls0 = lstepf(gs, ls, E9, a), pc0 = E10, gstepf(gs, ls, E9, a).orl ≠ [], ls.tid ≠ ls0.tid, DMSQGInv(gs), DMSQLInv(gs, ls, E9), allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp), allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp), listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs), markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps), nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs), nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs), pre(gs, ls, E9, a), rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns), rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns), unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps), gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl, ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl), ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node], gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val), lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node), (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ), gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null, gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ⊦

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ lstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true ;ls.success:= false ); (s) ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s)

Proof step 762 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp = dom ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl ≠ [], ls.tid ≠ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, DMSQGInv(gs), DMSQLInv(gs, ls, E9), allocrv (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp), allocrv (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp), listp ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns), markedp (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs), markedp (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps), nextnottid (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs), noid (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs), nonullRetRefs ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs), rvownerok (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns), rvownerok (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns), unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps), ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl, ¬ dups(((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl), ¬ dups(((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl), ¬ dups ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl), ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).success → ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl ∧ ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node) = Some(((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ] = mk(((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).value, None, null) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ] = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ], ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ] .next ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID ≠ None → ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID .tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID .tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .val), ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).success → ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node ] .val = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).value ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vtail ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ] .next = null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .owns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node) = Weak(((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid) ∨ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node), (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).success ⊃ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ] .next ≠ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).lst ] .next ⊃ oneweakowns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ;noowns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) ) ;oneowns (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true;ls.success:= false).node, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ), ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vtail = ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ).last ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vtail = ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .butlast ).last ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .last ] .deqID = None ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .last ] .next = null, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .last = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ≠ [] → unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .tail, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs)) ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .butlast ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .butlast .last = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ≠ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .last ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ⊦

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 6

Additional information

Used simplifier rules: ⊦ (ls.success:= success).tid = ls.tid; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.vs:= ps0).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.vs:= ps0).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.vs:= ps0).orl = gs.orl; (s)

Proof step 763 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E10, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 764 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = pcstepf(gs, ls, E10, a), DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E10, seq: ⊦ pcstepf(gs, ls, E10, a) = (ls.success ⊃ E11;E13), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 765 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E10, a) = (ls.success ⊃ E11;E13)

A spec-lemma

Proof step 766 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = (ls.success ⊃ E11;E13), DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 3

Additional information

Proof step 767 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E10-E11, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E11 → ( lstepf(gs, ls, E10, a).success ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node].val = lstepf(gs, ls, E10, a).value ∧ ( lstepf(gs, ls, E10, a).lst = gstepf(gs, ls, E10, a).vtail ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = null ∧ gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Weak(lstepf(gs, ls, E10, a).tid) ∨ lstepf(gs, ls, E10, a).lst ∈ gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node)) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok (gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv (gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv (gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs (gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ ( gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = ( gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast ).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E10, a).vs [(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ ( gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next ≠ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ;noowns(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).owns) ), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 768 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E11 → ( lstepf(gs, ls, E10, a).success ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node].val = lstepf(gs, ls, E10, a).value ∧ ( lstepf(gs, ls, E10, a).lst = gstepf(gs, ls, E10, a).vtail ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = null ∧ gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Weak(lstepf(gs, ls, E10, a).tid) ∨ lstepf(gs, ls, E10, a).lst ∈ gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node)) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ (gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next ≠ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ;noowns(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).owns) )

Lemma step-E10-E11

Proof step 769 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E11 → ( lstepf(gs, ls, E10, a).success ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node].val = lstepf(gs, ls, E10, a).value ∧ ( lstepf(gs, ls, E10, a).lst = gstepf(gs, ls, E10, a).vtail ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = null ∧ gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Weak(lstepf(gs, ls, E10, a).tid) ∨ lstepf(gs, ls, E10, a).lst ∈ gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node)) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ (gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next ≠ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ;noowns(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).owns) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 770 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E11

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 771 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 772 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, gs.orl ≠ [], ls.success, DMSQLInv(gs, ls, E10), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E10, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E11, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E10, a) = (ls.success ⊃ E11;E13); (s) Used terms: gs, ls, E10

Proof step 773 from proof copied-step-DMSQLInv (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 774 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node].val = lstepf(gs, ls, E10, a).value, dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, lstepf(gs, ls, E10, a).node ≠ null, gstepf(gs, ls, E10, a).orl ≠ [], ls.success, lstepf(gs, ls, E10, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, E10), allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp), allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp), listp(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs), nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs), pre(gs, ls, E10, a), rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns), rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns), unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps), gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl, ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl), gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val), (gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next ≠ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ;noowns(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).owns) ), lstepf(gs, ls, E10, a).lst = gstepf(gs, ls, E10, a).vtail ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = null ∧ gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Weak(lstepf(gs, ls, E10, a).tid) ∨ lstepf(gs, ls, E10, a).lst ∈ gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs), gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 775 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 776 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node].val = lstepf(gs, ls, E10, a).value, dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E11, lstepf(gs, ls, E10, a).node ≠ null, gstepf(gs, ls, E10, a).orl ≠ [], lstepf(gs, ls, E10, a).success, ls.success, DMSQGInv(gs), DMSQLInv(gs, ls, E10), allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp), allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp), listp(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps), nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs), pre(gs, ls, E10, a), rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns), rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns), unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps), gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl, ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl), gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val), (gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next ≠ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ;noowns(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).owns) ), gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null, gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs), lstepf(gs, ls, E10, a).lst = gstepf(gs, ls, E10, a).vtail ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = null ∧ gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Weak(lstepf(gs, ls, E10, a).tid) ∨ lstepf(gs, ls, E10, a).lst ∈ gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).lst].next = lstepf(gs, ls, E10, a).node ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ D3 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ E1 ≠ E11; (s) ⊦ E11 ≠ E12; (s) ⊦ E11 ≠ E17; (s) ⊦ E2 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E16; (s) ⊦ E10 ≠ E11; (s) ⊦ E4 ≠ E11; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E10, τ) = gs; (s) ⊦ lstepf(gs, ls, E10, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 777 from proof copied-step-DMSQLInv (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 778 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E10-E13, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E13 → gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Some(lstepf(gs, ls, E10, a).tid) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok (gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv (gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv (gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs (gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E10, a).vs [gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ ( gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = ( gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast ).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E10, a).vs [(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).ps ∧ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).vs ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).orl ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).qrl) ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] = mk(lstepf(gs, ls, E10, a).value, None, null) ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).node] = gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] ∧ ¬ lstepf(gs, ls, E10, a).success ∧ nextnottid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ oneowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 779 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E13 → gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Some(lstepf(gs, ls, E10, a).tid) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).ps ∧ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).vs ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).orl ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).qrl) ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] = mk(lstepf(gs, ls, E10, a).value, None, null) ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).node] = gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] ∧ ¬ lstepf(gs, ls, E10, a).success ∧ nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid (lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ oneowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps)

Lemma step-E10-E13

Proof step 780 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a), ¬ ls.success, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E13 → gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Some(lstepf(gs, ls, E10, a).tid) ∧ ( listp (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns) ∧ ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps) ∧ markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs) ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps) ∧ gstepf(gs, ls, E10, a).orl ≠ [] ∧ gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl ∧ rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns) ∧ allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp) ∧ dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp ∧ ( gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs)) ∧ ( gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).ps ∧ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).vs ∧ lstepf(gs, ls, E10, a).node ≠ null ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).orl ∧ ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).qrl) ∧ gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] = mk(lstepf(gs, ls, E10, a).value, None, null) ∧ gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).node] = gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] ∧ ¬ lstepf(gs, ls, E10, a).success ∧ nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs) ∧ oneowns (lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 8

Additional information

Proof step 781 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, DMSQGInv(gs), DMSQLInv(gs, ls, E10), pre(gs, ls, E10, a), ¬ ls.success ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E13

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 782 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 783 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, gs.orl ≠ [], DMSQLInv(gs, ls, E10), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E10, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ¬ 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]) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E10, a) ∧ pcstepf(gs, ls, E10, a) = E13, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E10], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E10; (s) ⊦ D2 ≠ E10; (s) ⊦ E10 ≠ E17; (s) ⊦ E10 ≠ crashed; (s) ⊦ E10 ≠ idle; (s) ⊦ E10 ≠ ready; (s) ⊦ E1 ≠ E10; (s) ⊦ D7 ≠ E10; (s) ⊦ D32 ≠ E10; (s) ⊦ D33 ≠ E10; (s) ⊦ E4 ≠ E10; (s) ⊦ E10 ≠ E16; (s) ⊦ E10 ≠ E15; (s) ⊦ E10 ≠ E14; (s) ⊦ E10 ≠ E13; (s) ⊦ E10 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E10; (s) ⊦ E8 ≠ E10; (s) ⊦ E7 ≠ E10; (s) ⊦ E6 ≠ E10; (s) ⊦ E5 ≠ E10; (s) ⊦ E3 ≠ E10; (s) ⊦ E2 ≠ E10; (s) ⊦ D34 ≠ E10; (s) ⊦ D31 ≠ E10; (s) ⊦ D30 ≠ E10; (s) ⊦ D29 ≠ E10; (s) ⊦ D28 ≠ E10; (s) ⊦ D27 ≠ E10; (s) ⊦ D26 ≠ E10; (s) ⊦ D25 ≠ E10; (s) ⊦ D24 ≠ E10; (s) ⊦ D23 ≠ E10; (s) ⊦ D22 ≠ E10; (s) ⊦ D21 ≠ E10; (s) ⊦ D20 ≠ E10; (s) ⊦ D19 ≠ E10; (s) ⊦ D18 ≠ E10; (s) ⊦ D17 ≠ E10; (s) ⊦ D16 ≠ E10; (s) ⊦ D15 ≠ E10; (s) ⊦ D14 ≠ E10; (s) ⊦ D13 ≠ E10; (s) ⊦ D12 ≠ E10; (s) ⊦ D11 ≠ E10; (s) ⊦ D10 ≠ E10; (s) ⊦ D9 ≠ E10; (s) ⊦ D8 ≠ E10; (s) ⊦ D6 ≠ E10; (s) ⊦ D5 ≠ E10; (s) ⊦ D4 ≠ E10; (s) ⊦ D3 ≠ E10; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E10, a) = (ls.success ⊃ E11;E13); (s) Used terms: gs, ls, E10

Proof step 784 from proof copied-step-DMSQLInv (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 785 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Some(lstepf(gs, ls, E10, a).tid), gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] = mk(lstepf(gs, ls, E10, a).value, None, null), gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).node] = gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node], dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, lstepf(gs, ls, E10, a).node ≠ null, gstepf(gs, ls, E10, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E10), allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp), allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp), listp(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs), nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs), oneowns(lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps), pre(gs, ls, E10, a), rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns), rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns), unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps), gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl, lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).ps, lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).vs, ¬ lstepf(gs, ls, E10, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl), ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).qrl, ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val), gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs), gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 786 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 787 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E10, a).owns(lstepf(gs, ls, E10, a).node) = Some(lstepf(gs, ls, E10, a).tid), gstepf(gs, ls, E10, a).ps[lstepf(gs, ls, E10, a).node] = gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node], gstepf(gs, ls, E10, a).vs[lstepf(gs, ls, E10, a).node] = mk(lstepf(gs, ls, E10, a).value, None, null), dom gstepf(gs, ls, E10, a).vrvHp = dom gstepf(gs, ls, E10, a).prvHp, gs0 = gstepf(gs, ls, E10, a), ls0 = lstepf(gs, ls, E10, a), pc0 = E13, lstepf(gs, ls, E10, a).node ≠ null, gstepf(gs, ls, E10, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E10), allocrv(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp), allocrv(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp), listp(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).owns), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs), markedp(gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).ps), nextnottid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), noid(lstepf(gs, ls, E10, a).tid, gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vhead, gstepf(gs, ls, E10, a).vs), nonullRetRefs (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).pretRefs), oneowns(lstepf(gs, ls, E10, a).tid, lstepf(gs, ls, E10, a).node, gstepf(gs, ls, E10, a).owns, gstepf(gs, ls, E10, a).vs, gstepf(gs, ls, E10, a).ps), pre(gs, ls, E10, a), rvownerok(gstepf(gs, ls, E10, a).pretRefs, gstepf(gs, ls, E10, a).prvHp, gstepf(gs, ls, E10, a).rvowns), rvownerok(gstepf(gs, ls, E10, a).vretRefs, gstepf(gs, ls, E10, a).vrvHp, gstepf(gs, ls, E10, a).rvowns), unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).ps), lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).vs, lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).ps, gstepf(gs, ls, E10, a).phead ∈ gstepf(gs, ls, E10, a).orl, ¬ lstepf(gs, ls, E10, a).success, ¬ ls.success, ¬ dups(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl), ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).qrl, ¬ lstepf(gs, ls, E10, a).node ∈ gstepf(gs, ls, E10, a).orl, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next ≠ null ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E10, a).rvowns (gstepf(gs, ls, E10, a).vretRefs(gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].deqID.tid, gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).vhead].next].val), gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last ∨ gstepf(gs, ls, E10, a).qrl ≠ [] ∧ gstepf(gs, ls, E10, a).vtail = (gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl.butlast).last ∧ gstepf(gs, ls, E10, a).vs[gstepf(gs, ls, E10, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E10, a).vs[(gstepf(gs, ls, E10, a).orl + gstepf(gs, ls, E10, a).qrl).last].next = null, gstepf(gs, ls, E10, a).orl.last = gstepf(gs, ls, E10, a).vhead ∧ (gstepf(gs, ls, E10, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E10, a).qrl.tail, gstepf(gs, ls, E10, a).vs)) ∨ gstepf(gs, ls, E10, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E10, a).orl.butlast.last = gstepf(gs, ls, E10, a).vhead ∧ gstepf(gs, ls, E10, a).phead ≠ gstepf(gs, ls, E10, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E10, a).qrl, gstepf(gs, ls, E10, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E10, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E13 ≠ E14; (s) ⊦ E13 ≠ E15; (s) ⊦ E13 ≠ E16; (s) ⊦ E13 ≠ crashed; (s) ⊦ E13 ≠ idle; (s) ⊦ E13 ≠ ready; (s) ⊦ D1 ≠ E13; (s) ⊦ D2 ≠ E13; (s) ⊦ D3 ≠ E13; (s) ⊦ D4 ≠ E13; (s) ⊦ D5 ≠ E13; (s) ⊦ D6 ≠ E13; (s) ⊦ D7 ≠ E13; (s) ⊦ D8 ≠ E13; (s) ⊦ D9 ≠ E13; (s) ⊦ D10 ≠ E13; (s) ⊦ D11 ≠ E13; (s) ⊦ D12 ≠ E13; (s) ⊦ D13 ≠ E13; (s) ⊦ D14 ≠ E13; (s) ⊦ D15 ≠ E13; (s) ⊦ D16 ≠ E13; (s) ⊦ D17 ≠ E13; (s) ⊦ D18 ≠ E13; (s) ⊦ D19 ≠ E13; (s) ⊦ D20 ≠ E13; (s) ⊦ D21 ≠ E13; (s) ⊦ D22 ≠ E13; (s) ⊦ D23 ≠ E13; (s) ⊦ D24 ≠ E13; (s) ⊦ D25 ≠ E13; (s) ⊦ D26 ≠ E13; (s) ⊦ D27 ≠ E13; (s) ⊦ D28 ≠ E13; (s) ⊦ D29 ≠ E13; (s) ⊦ D30 ≠ E13; (s) ⊦ D31 ≠ E13; (s) ⊦ D32 ≠ E13; (s) ⊦ D33 ≠ E13; (s) ⊦ D34 ≠ E13; (s) ⊦ E1 ≠ E13; (s) ⊦ E12 ≠ E13; (s) ⊦ E13 ≠ E17; (s) ⊦ E2 ≠ E13; (s) ⊦ E3 ≠ E13; (s) ⊦ E5 ≠ E13; (s) ⊦ E6 ≠ E13; (s) ⊦ E7 ≠ E13; (s) ⊦ E8 ≠ E13; (s) ⊦ E9 ≠ E13; (s) ⊦ E10 ≠ E13; (s) ⊦ E11 ≠ E13; (s) ⊦ E4 ≠ E13; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E10, τ) = gs; (s) ⊦ lstepf(gs, ls, E10, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 788 from proof copied-step-DMSQLInv (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 789 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E11, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 790 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = pcstepf(gs, ls, E11, a), DMSQGInv(gs), DMSQLInv(gs, ls, E11), pre(gs, ls, E11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E11, seq: ⊦ pcstepf(gs, ls, E11, a) = E12, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 791 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E11, a) = E12

A spec-lemma

Proof step 792 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, DMSQGInv(gs), DMSQLInv(gs, ls, E11), pre(gs, ls, E11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E11-E12, seq:⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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) )) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → ( lstepf(gs, ls, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok (gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv (gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv (gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs [gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs (gstepf(gs, ls, E11, a).vs [gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E11, a).vs [gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E11, a).vs [gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ ( gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = ( gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast ).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E11, a).vs [(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid (lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 793 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → ( lstepf(gs, ls, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid (lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns)

Lemma step-E11-E12

Proof step 794 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, DMSQGInv(gs), DMSQLInv(gs, ls, E11), pre(gs, ls, E11, a), ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → ( lstepf(gs, ls, E11, a).success ∧ lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl ∧ gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps ∧ lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs ∧ lstepf(gs, ls, E11, a).node ≠ null) ∧ ( listp (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps) ∧ markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs) ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps) ∧ gstepf(gs, ls, E11, a).orl ≠ [] ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl ∧ rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns) ∧ allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp) ∧ dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp ∧ ( gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs)) ∧ ( gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 795 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, DMSQGInv(gs), DMSQLInv(gs, ls, E11), pre(gs, ls, E11, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 796 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 797 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, gs.orl ≠ [], DMSQLInv(gs, ls, E11), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E11, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (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))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E11], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E11; (s) ⊦ D2 ≠ E11; (s) ⊦ E11 ≠ E17; (s) ⊦ E11 ≠ crashed; (s) ⊦ E11 ≠ idle; (s) ⊦ E11 ≠ ready; (s) ⊦ E1 ≠ E11; (s) ⊦ D7 ≠ E11; (s) ⊦ D32 ≠ E11; (s) ⊦ D33 ≠ E11; (s) ⊦ E4 ≠ E11; (s) ⊦ E11 ≠ E16; (s) ⊦ E11 ≠ E15; (s) ⊦ E11 ≠ E14; (s) ⊦ E11 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ E10 ≠ E11; (s) ⊦ E9 ≠ E11; (s) ⊦ E8 ≠ E11; (s) ⊦ E7 ≠ E11; (s) ⊦ E6 ≠ E11; (s) ⊦ E5 ≠ E11; (s) ⊦ E3 ≠ E11; (s) ⊦ E2 ≠ E11; (s) ⊦ D34 ≠ E11; (s) ⊦ D31 ≠ E11; (s) ⊦ D30 ≠ E11; (s) ⊦ D29 ≠ E11; (s) ⊦ D28 ≠ E11; (s) ⊦ D27 ≠ E11; (s) ⊦ D26 ≠ E11; (s) ⊦ D25 ≠ E11; (s) ⊦ D24 ≠ E11; (s) ⊦ D23 ≠ E11; (s) ⊦ D22 ≠ E11; (s) ⊦ D21 ≠ E11; (s) ⊦ D20 ≠ E11; (s) ⊦ D19 ≠ E11; (s) ⊦ D18 ≠ E11; (s) ⊦ D17 ≠ E11; (s) ⊦ D16 ≠ E11; (s) ⊦ D15 ≠ E11; (s) ⊦ D14 ≠ E11; (s) ⊦ D13 ≠ E11; (s) ⊦ D12 ≠ E11; (s) ⊦ D11 ≠ E11; (s) ⊦ D10 ≠ E11; (s) ⊦ D9 ≠ E11; (s) ⊦ D8 ≠ E11; (s) ⊦ D6 ≠ E11; (s) ⊦ D5 ≠ E11; (s) ⊦ D4 ≠ E11; (s) ⊦ D3 ≠ E11; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, E11, a) = E12; (s) Used terms: gs, ls, E11

Proof step 798 from proof copied-step-DMSQLInv (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 799 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node, gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node, dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp, gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, lstepf(gs, ls, E11, a).node ≠ null, gstepf(gs, ls, E11, a).orl ≠ [], lstepf(gs, ls, E11, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, E11), allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp), allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp), listp(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns), markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps), markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs), nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs), noid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs), nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs), noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns), pre(gs, ls, E11, a), rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns), rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns), unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps), lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl, ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl), gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val), gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs), gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 800 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 801 from proof copied-step-DMSQLInv (previous step) (back to tree)

gstepf(gs, ls, E11, a).ps[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node, gstepf(gs, ls, E11, a).vs[lstepf(gs, ls, E11, a).lst].next = lstepf(gs, ls, E11, a).node, dom gstepf(gs, ls, E11, a).vrvHp = dom gstepf(gs, ls, E11, a).prvHp, gs0 = gstepf(gs, ls, E11, a), ls0 = lstepf(gs, ls, E11, a), pc0 = E12, lstepf(gs, ls, E11, a).node ≠ null, gstepf(gs, ls, E11, a).orl ≠ [], lstepf(gs, ls, E11, a).success, DMSQGInv(gs), DMSQLInv(gs, ls, E11), allocrv(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp), allocrv(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp), listp(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns), markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).vs), markedp(gstepf(gs, ls, E11, a).orl, gstepf(gs, ls, E11, a).ps), nextnottid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs), noid(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs), nonullRetRefs (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).pretRefs), noowns(lstepf(gs, ls, E11, a).tid, gstepf(gs, ls, E11, a).owns), pre(gs, ls, E11, a), rvownerok(gstepf(gs, ls, E11, a).pretRefs, gstepf(gs, ls, E11, a).prvHp, gstepf(gs, ls, E11, a).rvowns), rvownerok(gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp, gstepf(gs, ls, E11, a).rvowns), unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).ps), gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).vs, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).ps, lstepf(gs, ls, E11, a).node ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, lstepf(gs, ls, E11, a).lst ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, ¬ dups(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl), gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next ≠ null ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E11, a).rvowns (gstepf(gs, ls, E11, a).vretRefs(gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].deqID.tid, gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).vhead].next].val), gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last ∨ gstepf(gs, ls, E11, a).qrl ≠ [] ∧ gstepf(gs, ls, E11, a).vtail = (gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl.butlast).last ∧ gstepf(gs, ls, E11, a).vs[gstepf(gs, ls, E11, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E11, a).vs[(gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl).last].next = null, gstepf(gs, ls, E11, a).orl.last = gstepf(gs, ls, E11, a).vhead ∧ (gstepf(gs, ls, E11, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E11, a).qrl.tail, gstepf(gs, ls, E11, a).vs)) ∨ gstepf(gs, ls, E11, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E11, a).orl.butlast.last = gstepf(gs, ls, E11, a).vhead ∧ gstepf(gs, ls, E11, a).phead ≠ gstepf(gs, ls, E11, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ E12 ≠ crashed; (s) ⊦ E12 ≠ idle; (s) ⊦ E12 ≠ ready; (s) ⊦ D1 ≠ E12; (s) ⊦ D2 ≠ E12; (s) ⊦ D3 ≠ E12; (s) ⊦ D4 ≠ E12; (s) ⊦ D5 ≠ E12; (s) ⊦ D6 ≠ E12; (s) ⊦ D7 ≠ E12; (s) ⊦ D8 ≠ E12; (s) ⊦ D9 ≠ E12; (s) ⊦ D10 ≠ E12; (s) ⊦ D11 ≠ E12; (s) ⊦ D12 ≠ E12; (s) ⊦ D13 ≠ E12; (s) ⊦ D14 ≠ E12; (s) ⊦ D15 ≠ E12; (s) ⊦ D16 ≠ E12; (s) ⊦ D17 ≠ E12; (s) ⊦ D18 ≠ E12; (s) ⊦ D19 ≠ E12; (s) ⊦ D20 ≠ E12; (s) ⊦ D21 ≠ E12; (s) ⊦ D22 ≠ E12; (s) ⊦ D23 ≠ E12; (s) ⊦ D24 ≠ E12; (s) ⊦ D25 ≠ E12; (s) ⊦ D26 ≠ E12; (s) ⊦ D27 ≠ E12; (s) ⊦ D28 ≠ E12; (s) ⊦ D29 ≠ E12; (s) ⊦ D30 ≠ E12; (s) ⊦ D31 ≠ E12; (s) ⊦ D32 ≠ E12; (s) ⊦ D33 ≠ E12; (s) ⊦ D34 ≠ E12; (s) ⊦ E1 ≠ E12; (s) ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ E2 ≠ E12; (s) ⊦ E3 ≠ E12; (s) ⊦ E5 ≠ E12; (s) ⊦ E6 ≠ E12; (s) ⊦ E7 ≠ E12; (s) ⊦ E8 ≠ E12; (s) ⊦ E9 ≠ E12; (s) ⊦ E12 ≠ E13; (s) ⊦ E12 ≠ E14; (s) ⊦ E12 ≠ E15; (s) ⊦ E12 ≠ E16; (s) ⊦ E10 ≠ E12; (s) ⊦ E11 ≠ E12; (s) ⊦ E4 ≠ E12; (s) ⊦ lstepf(gs, ls, E11, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 802 from proof copied-step-DMSQLInv (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 803 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E12, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 804 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = pcstepf(gs, ls, E12, a), DMSQGInv(gs), DMSQLInv(gs, ls, E12), pre(gs, ls, E12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E12, seq: ⊦ pcstepf(gs, ls, E12, a) = E4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 805 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E12, a) = E4

A spec-lemma

Proof step 806 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E12), pre(gs, ls, E12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E12-E4, seq:⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → ( listp (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ ¬ dups(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).ps) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).vs) ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).ps) ∧ gstepf(gs, ls, E12, a).orl ≠ [] ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl ∧ rvownerok (gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv (gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv (gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp) ∧ dom gstepf(gs, ls, E12, a).vrvHp = dom gstepf(gs, ls, E12, a).prvHp ∧ ( gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ≠ null ∧ gstepf(gs, ls, E12, a).vs [gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E12, a).rvowns (gstepf(gs, ls, E12, a).vretRefs (gstepf(gs, ls, E12, a).vs [gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E12, a).vs [gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E12, a).vs [gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E12, a).orl.last = gstepf(gs, ls, E12, a).vhead ∧ ( gstepf(gs, ls, E12, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E12, a).qrl.tail, gstepf(gs, ls, E12, a).vs)) ∨ gstepf(gs, ls, E12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E12, a).orl.butlast.last = gstepf(gs, ls, E12, a).vhead ∧ gstepf(gs, ls, E12, a).phead ≠ gstepf(gs, ls, E12, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs)) ∧ ( gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last ∨ gstepf(gs, ls, E12, a).qrl ≠ [] ∧ gstepf(gs, ls, E12, a).vtail = ( gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl.butlast ).last ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E12, a).vs [(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E12, a).success → ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).orl ∧ ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).qrl ∧ lstepf(gs, ls, E12, a).node ≠ null ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).ps ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).vs ∧ gstepf(gs, ls, E12, a).owns(lstepf(gs, ls, E12, a).node) = Some(lstepf(gs, ls, E12, a).tid) ∧ gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node] = mk(lstepf(gs, ls, E12, a).value, None, null) ∧ gstepf(gs, ls, E12, a).ps[lstepf(gs, ls, E12, a).node] = gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node]) ∧ nextnottid (lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ noid (lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ (lstepf(gs, ls, E12, a).success ⊃ noowns(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).owns) ;oneowns (lstepf(gs, ls, E12, a).tid, lstepf(gs, ls, E12, a).node, gstepf(gs, ls, E12, a).owns, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ), subst:[ls, gs, a] → [ls, gs, a]

Additional information

Used terms: ls, gs, a

Proof step 807 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → ( listp (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ ¬ dups(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).ps) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).vs) ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).ps) ∧ gstepf(gs, ls, E12, a).orl ≠ [] ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl ∧ rvownerok(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp) ∧ dom gstepf(gs, ls, E12, a).vrvHp = dom gstepf(gs, ls, E12, a).prvHp ∧ ( gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ≠ null ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E12, a).rvowns (gstepf(gs, ls, E12, a).vretRefs(gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid, gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E12, a).orl.last = gstepf(gs, ls, E12, a).vhead ∧ (gstepf(gs, ls, E12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E12, a).qrl.tail, gstepf(gs, ls, E12, a).vs)) ∨ gstepf(gs, ls, E12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E12, a).orl.butlast.last = gstepf(gs, ls, E12, a).vhead ∧ gstepf(gs, ls, E12, a).phead ≠ gstepf(gs, ls, E12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs)) ∧ ( gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last ∨ gstepf(gs, ls, E12, a).qrl ≠ [] ∧ gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl.butlast).last ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E12, a).vs[(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E12, a).success → ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).orl ∧ ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).qrl ∧ lstepf(gs, ls, E12, a).node ≠ null ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).ps ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).vs ∧ gstepf(gs, ls, E12, a).owns(lstepf(gs, ls, E12, a).node) = Some(lstepf(gs, ls, E12, a).tid) ∧ gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node] = mk(lstepf(gs, ls, E12, a).value, None, null) ∧ gstepf(gs, ls, E12, a).ps[lstepf(gs, ls, E12, a).node] = gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node]) ∧ nextnottid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ noid (lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ (lstepf(gs, ls, E12, a).success ⊃ noowns(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).owns) ;oneowns (lstepf(gs, ls, E12, a).tid, lstepf(gs, ls, E12, a).node, gstepf(gs, ls, E12, a).owns, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) )

Lemma step-E12-E4

Proof step 808 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E12), pre(gs, ls, E12, a), ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4 → ( listp (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ ¬ dups(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).ps) ∧ markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).vs) ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).ps) ∧ gstepf(gs, ls, E12, a).orl ≠ [] ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl ∧ rvownerok(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp, gstepf(gs, ls, E12, a).rvowns) ∧ allocrv(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp) ∧ dom gstepf(gs, ls, E12, a).vrvHp = dom gstepf(gs, ls, E12, a).prvHp ∧ ( gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ≠ null ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E12, a).rvowns (gstepf(gs, ls, E12, a).vretRefs(gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid, gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E12, a).orl.last = gstepf(gs, ls, E12, a).vhead ∧ (gstepf(gs, ls, E12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E12, a).qrl.tail, gstepf(gs, ls, E12, a).vs)) ∨ gstepf(gs, ls, E12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E12, a).orl.butlast.last = gstepf(gs, ls, E12, a).vhead ∧ gstepf(gs, ls, E12, a).phead ≠ gstepf(gs, ls, E12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs)) ∧ ( gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last ∨ gstepf(gs, ls, E12, a).qrl ≠ [] ∧ gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl.butlast).last ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E12, a).vs[(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E12, a).success → ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).orl ∧ ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).qrl ∧ lstepf(gs, ls, E12, a).node ≠ null ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).ps ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).vs ∧ gstepf(gs, ls, E12, a).owns(lstepf(gs, ls, E12, a).node) = Some(lstepf(gs, ls, E12, a).tid) ∧ gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node] = mk(lstepf(gs, ls, E12, a).value, None, null) ∧ gstepf(gs, ls, E12, a).ps[lstepf(gs, ls, E12, a).node] = gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node]) ∧ nextnottid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ noid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ (lstepf(gs, ls, E12, a).success ⊃ noowns(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).owns) ;oneowns (lstepf(gs, ls, E12, a).tid, lstepf(gs, ls, E12, a).node, gstepf(gs, ls, E12, a).owns, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 809 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E12), pre(gs, ls, E12, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 810 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 811 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, gs.orl ≠ [], DMSQLInv(gs, ls, E12), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E12, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E12, a) ∧ pcstepf(gs, ls, E12, a) = E4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E12], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E12; (s) ⊦ D2 ≠ E12; (s) ⊦ E12 ≠ crashed; (s) ⊦ E12 ≠ idle; (s) ⊦ E12 ≠ ready; (s) ⊦ E1 ≠ E12; (s) ⊦ D7 ≠ E12; (s) ⊦ D32 ≠ E12; (s) ⊦ D33 ≠ E12; (s) ⊦ E4 ≠ E12; (s) ⊦ E12 ≠ E16; (s) ⊦ E12 ≠ E15; (s) ⊦ E12 ≠ E14; (s) ⊦ E12 ≠ E13; (s) ⊦ E11 ≠ E12; (s) ⊦ E10 ≠ E12; (s) ⊦ E9 ≠ E12; (s) ⊦ E8 ≠ E12; (s) ⊦ E7 ≠ E12; (s) ⊦ E6 ≠ E12; (s) ⊦ E5 ≠ E12; (s) ⊦ E3 ≠ E12; (s) ⊦ E2 ≠ E12; (s) ⊦ D34 ≠ E12; (s) ⊦ D31 ≠ E12; (s) ⊦ D30 ≠ E12; (s) ⊦ D29 ≠ E12; (s) ⊦ D28 ≠ E12; (s) ⊦ D27 ≠ E12; (s) ⊦ D26 ≠ E12; (s) ⊦ D25 ≠ E12; (s) ⊦ D24 ≠ E12; (s) ⊦ D23 ≠ E12; (s) ⊦ D22 ≠ E12; (s) ⊦ D21 ≠ E12; (s) ⊦ D20 ≠ E12; (s) ⊦ D19 ≠ E12; (s) ⊦ D18 ≠ E12; (s) ⊦ D17 ≠ E12; (s) ⊦ D16 ≠ E12; (s) ⊦ D15 ≠ E12; (s) ⊦ D14 ≠ E12; (s) ⊦ D13 ≠ E12; (s) ⊦ D12 ≠ E12; (s) ⊦ D11 ≠ E12; (s) ⊦ D10 ≠ E12; (s) ⊦ D9 ≠ E12; (s) ⊦ D8 ≠ E12; (s) ⊦ D6 ≠ E12; (s) ⊦ D5 ≠ E12; (s) ⊦ D4 ≠ E12; (s) ⊦ D3 ≠ E12; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E12, a) = E4; (s) Used terms: gs, ls, E12

Proof step 812 from proof copied-step-DMSQLInv (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 813 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E12, a).vrvHp = dom gstepf(gs, ls, E12, a).prvHp, gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, gstepf(gs, ls, E12, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E12), allocrv(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp), allocrv(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp), listp(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns), markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).ps), markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).vs), nextnottid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs), noid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs), nonullRetRefs (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).pretRefs), pre(gs, ls, E12, a), rvownerok(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp, gstepf(gs, ls, E12, a).rvowns), rvownerok(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp, gstepf(gs, ls, E12, a).rvowns), unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).ps), gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl, ¬ dups(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl), gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ≠ null ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E12, a).rvowns (gstepf(gs, ls, E12, a).vretRefs(gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid, gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].val), ¬ lstepf(gs, ls, E12, a).success → ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).orl ∧ ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).qrl ∧ lstepf(gs, ls, E12, a).node ≠ null ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).ps ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).vs ∧ gstepf(gs, ls, E12, a).owns(lstepf(gs, ls, E12, a).node) = Some(lstepf(gs, ls, E12, a).tid) ∧ gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node] = mk(lstepf(gs, ls, E12, a).value, None, null) ∧ gstepf(gs, ls, E12, a).ps[lstepf(gs, ls, E12, a).node] = gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node], (lstepf(gs, ls, E12, a).success ⊃ noowns(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).owns) ;oneowns(lstepf(gs, ls, E12, a).tid, lstepf(gs, ls, E12, a).node, gstepf(gs, ls, E12, a).owns, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ), gstepf(gs, ls, E12, a).orl.last = gstepf(gs, ls, E12, a).vhead ∧ (gstepf(gs, ls, E12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E12, a).qrl.tail, gstepf(gs, ls, E12, a).vs)) ∨ gstepf(gs, ls, E12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E12, a).orl.butlast.last = gstepf(gs, ls, E12, a).vhead ∧ gstepf(gs, ls, E12, a).phead ≠ gstepf(gs, ls, E12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs), gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last ∨ gstepf(gs, ls, E12, a).qrl ≠ [] ∧ gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl.butlast).last ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E12, a).vs[(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 814 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 815 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E12, a).vrvHp = dom gstepf(gs, ls, E12, a).prvHp, gs0 = gstepf(gs, ls, E12, a), ls0 = lstepf(gs, ls, E12, a), pc0 = E4, gstepf(gs, ls, E12, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E12), allocrv(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp), allocrv(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp), listp(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns), markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).vs), markedp(gstepf(gs, ls, E12, a).orl, gstepf(gs, ls, E12, a).ps), nextnottid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs), noid(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs), nonullRetRefs (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).pretRefs), pre(gs, ls, E12, a), rvownerok(gstepf(gs, ls, E12, a).pretRefs, gstepf(gs, ls, E12, a).prvHp, gstepf(gs, ls, E12, a).rvowns), rvownerok(gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp, gstepf(gs, ls, E12, a).rvowns), unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).ps), gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl, ¬ dups(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl), ¬ lstepf(gs, ls, E12, a).success → ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).orl ∧ ¬ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).qrl ∧ lstepf(gs, ls, E12, a).node ≠ null ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).ps ∧ lstepf(gs, ls, E12, a).node ∈ gstepf(gs, ls, E12, a).vs ∧ gstepf(gs, ls, E12, a).owns(lstepf(gs, ls, E12, a).node) = Some(lstepf(gs, ls, E12, a).tid) ∧ gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node] = mk(lstepf(gs, ls, E12, a).value, None, null) ∧ gstepf(gs, ls, E12, a).ps[lstepf(gs, ls, E12, a).node] = gstepf(gs, ls, E12, a).vs[lstepf(gs, ls, E12, a).node], gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next ≠ null ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E12, a).rvowns (gstepf(gs, ls, E12, a).vretRefs(gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].deqID.tid, gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).vhead].next].val), (lstepf(gs, ls, E12, a).success ⊃ noowns(lstepf(gs, ls, E12, a).tid, gstepf(gs, ls, E12, a).owns) ;oneowns(lstepf(gs, ls, E12, a).tid, lstepf(gs, ls, E12, a).node, gstepf(gs, ls, E12, a).owns, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ), gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last ∨ gstepf(gs, ls, E12, a).qrl ≠ [] ∧ gstepf(gs, ls, E12, a).vtail = (gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl.butlast).last ∧ gstepf(gs, ls, E12, a).vs[gstepf(gs, ls, E12, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E12, a).vs[(gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl).last].next = null, gstepf(gs, ls, E12, a).orl.last = gstepf(gs, ls, E12, a).vhead ∧ (gstepf(gs, ls, E12, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E12, a).qrl.tail, gstepf(gs, ls, E12, a).vs)) ∨ gstepf(gs, ls, E12, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E12, a).orl.butlast.last = gstepf(gs, ls, E12, a).vhead ∧ gstepf(gs, ls, E12, a).phead ≠ gstepf(gs, ls, E12, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E12, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ E5; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E11; (s) ⊦ gstepf(gs, ls, E12, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.node;gs); (s) ⊦ lstepf(gs, ls, E12, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 816 from proof copied-step-DMSQLInv (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 817 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E13, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 818 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = pcstepf(gs, ls, E13, a), DMSQGInv(gs), DMSQLInv(gs, ls, E13), pre(gs, ls, E13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E13, seq: ⊦ pcstepf(gs, ls, E13, a) = E4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 819 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E13, a) = E4

A spec-lemma

Proof step 820 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E13), pre(gs, ls, E13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E13-E4, seq:⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E13, a) ∧ pcstepf(gs, ls, E13, a) = E4 → ( listp (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps, gstepf(gs, ls, E13, a).owns) ∧ ¬ dups(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).ps) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).vs) ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).ps) ∧ gstepf(gs, ls, E13, a).orl ≠ [] ∧ gstepf(gs, ls, E13, a).phead ∈ gstepf(gs, ls, E13, a).orl ∧ rvownerok (gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv (gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv (gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp) ∧ dom gstepf(gs, ls, E13, a).vrvHp = dom gstepf(gs, ls, E13, a).prvHp ∧ ( gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ≠ null ∧ gstepf(gs, ls, E13, a).vs [gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E13, a).rvowns (gstepf(gs, ls, E13, a).vretRefs (gstepf(gs, ls, E13, a).vs [gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E13, a).vs [gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E13, a).vs [gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E13, a).orl.last = gstepf(gs, ls, E13, a).vhead ∧ ( gstepf(gs, ls, E13, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E13, a).qrl.tail, gstepf(gs, ls, E13, a).vs)) ∨ gstepf(gs, ls, E13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E13, a).orl.butlast.last = gstepf(gs, ls, E13, a).vhead ∧ gstepf(gs, ls, E13, a).phead ≠ gstepf(gs, ls, E13, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs)) ∧ ( gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last ∨ gstepf(gs, ls, E13, a).qrl ≠ [] ∧ gstepf(gs, ls, E13, a).vtail = ( gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl.butlast ).last ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E13, a).vs [(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E13, a).success → ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).orl ∧ ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).qrl ∧ lstepf(gs, ls, E13, a).node ≠ null ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).ps ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).vs ∧ gstepf(gs, ls, E13, a).owns(lstepf(gs, ls, E13, a).node) = Some(lstepf(gs, ls, E13, a).tid) ∧ gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node] = mk(lstepf(gs, ls, E13, a).value, None, null) ∧ gstepf(gs, ls, E13, a).ps[lstepf(gs, ls, E13, a).node] = gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node]) ∧ nextnottid (lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ noid (lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ (lstepf(gs, ls, E13, a).success ⊃ noowns(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).owns) ;oneowns (lstepf(gs, ls, E13, a).tid, lstepf(gs, ls, E13, a).node, gstepf(gs, ls, E13, a).owns, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps) ), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 821 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E13, a) ∧ pcstepf(gs, ls, E13, a) = E4 → ( listp (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps, gstepf(gs, ls, E13, a).owns) ∧ ¬ dups(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).ps) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).vs) ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).ps) ∧ gstepf(gs, ls, E13, a).orl ≠ [] ∧ gstepf(gs, ls, E13, a).phead ∈ gstepf(gs, ls, E13, a).orl ∧ rvownerok(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp) ∧ dom gstepf(gs, ls, E13, a).vrvHp = dom gstepf(gs, ls, E13, a).prvHp ∧ ( gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ≠ null ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E13, a).rvowns (gstepf(gs, ls, E13, a).vretRefs(gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid, gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E13, a).orl.last = gstepf(gs, ls, E13, a).vhead ∧ (gstepf(gs, ls, E13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E13, a).qrl.tail, gstepf(gs, ls, E13, a).vs)) ∨ gstepf(gs, ls, E13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E13, a).orl.butlast.last = gstepf(gs, ls, E13, a).vhead ∧ gstepf(gs, ls, E13, a).phead ≠ gstepf(gs, ls, E13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs)) ∧ ( gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last ∨ gstepf(gs, ls, E13, a).qrl ≠ [] ∧ gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl.butlast).last ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E13, a).vs[(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E13, a).success → ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).orl ∧ ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).qrl ∧ lstepf(gs, ls, E13, a).node ≠ null ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).ps ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).vs ∧ gstepf(gs, ls, E13, a).owns(lstepf(gs, ls, E13, a).node) = Some(lstepf(gs, ls, E13, a).tid) ∧ gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node] = mk(lstepf(gs, ls, E13, a).value, None, null) ∧ gstepf(gs, ls, E13, a).ps[lstepf(gs, ls, E13, a).node] = gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node]) ∧ nextnottid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ noid (lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ (lstepf(gs, ls, E13, a).success ⊃ noowns(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).owns) ;oneowns (lstepf(gs, ls, E13, a).tid, lstepf(gs, ls, E13, a).node, gstepf(gs, ls, E13, a).owns, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps) )

Lemma step-E13-E4

Proof step 822 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E13), pre(gs, ls, E13, a), ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E13, a) ∧ pcstepf(gs, ls, E13, a) = E4 → ( listp (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps, gstepf(gs, ls, E13, a).owns) ∧ ¬ dups(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).ps) ∧ markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).vs) ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).ps) ∧ gstepf(gs, ls, E13, a).orl ≠ [] ∧ gstepf(gs, ls, E13, a).phead ∈ gstepf(gs, ls, E13, a).orl ∧ rvownerok(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp, gstepf(gs, ls, E13, a).rvowns) ∧ allocrv(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp) ∧ dom gstepf(gs, ls, E13, a).vrvHp = dom gstepf(gs, ls, E13, a).prvHp ∧ ( gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ≠ null ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E13, a).rvowns (gstepf(gs, ls, E13, a).vretRefs(gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid, gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E13, a).orl.last = gstepf(gs, ls, E13, a).vhead ∧ (gstepf(gs, ls, E13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E13, a).qrl.tail, gstepf(gs, ls, E13, a).vs)) ∨ gstepf(gs, ls, E13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E13, a).orl.butlast.last = gstepf(gs, ls, E13, a).vhead ∧ gstepf(gs, ls, E13, a).phead ≠ gstepf(gs, ls, E13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs)) ∧ ( gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last ∨ gstepf(gs, ls, E13, a).qrl ≠ [] ∧ gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl.butlast).last ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E13, a).vs[(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E13, a).success → ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).orl ∧ ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).qrl ∧ lstepf(gs, ls, E13, a).node ≠ null ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).ps ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).vs ∧ gstepf(gs, ls, E13, a).owns(lstepf(gs, ls, E13, a).node) = Some(lstepf(gs, ls, E13, a).tid) ∧ gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node] = mk(lstepf(gs, ls, E13, a).value, None, null) ∧ gstepf(gs, ls, E13, a).ps[lstepf(gs, ls, E13, a).node] = gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node]) ∧ nextnottid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ noid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs) ∧ (lstepf(gs, ls, E13, a).success ⊃ noowns(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).owns) ;oneowns (lstepf(gs, ls, E13, a).tid, lstepf(gs, ls, E13, a).node, gstepf(gs, ls, E13, a).owns, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 823 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E13), pre(gs, ls, E13, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E13, a) ∧ pcstepf(gs, ls, E13, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 824 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 825 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, gs.orl ≠ [], DMSQLInv(gs, ls, E13), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E13, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E13, a) ∧ pcstepf(gs, ls, E13, a) = E4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E13], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E13; (s) ⊦ D2 ≠ E13; (s) ⊦ E13 ≠ E17; (s) ⊦ E13 ≠ crashed; (s) ⊦ E13 ≠ idle; (s) ⊦ E13 ≠ ready; (s) ⊦ E1 ≠ E13; (s) ⊦ D7 ≠ E13; (s) ⊦ D32 ≠ E13; (s) ⊦ D33 ≠ E13; (s) ⊦ E4 ≠ E13; (s) ⊦ E13 ≠ E16; (s) ⊦ E13 ≠ E15; (s) ⊦ E13 ≠ E14; (s) ⊦ E12 ≠ E13; (s) ⊦ E11 ≠ E13; (s) ⊦ E10 ≠ E13; (s) ⊦ E9 ≠ E13; (s) ⊦ E8 ≠ E13; (s) ⊦ E7 ≠ E13; (s) ⊦ E6 ≠ E13; (s) ⊦ E5 ≠ E13; (s) ⊦ E3 ≠ E13; (s) ⊦ E2 ≠ E13; (s) ⊦ D34 ≠ E13; (s) ⊦ D31 ≠ E13; (s) ⊦ D30 ≠ E13; (s) ⊦ D29 ≠ E13; (s) ⊦ D28 ≠ E13; (s) ⊦ D27 ≠ E13; (s) ⊦ D26 ≠ E13; (s) ⊦ D25 ≠ E13; (s) ⊦ D24 ≠ E13; (s) ⊦ D23 ≠ E13; (s) ⊦ D22 ≠ E13; (s) ⊦ D21 ≠ E13; (s) ⊦ D20 ≠ E13; (s) ⊦ D19 ≠ E13; (s) ⊦ D18 ≠ E13; (s) ⊦ D17 ≠ E13; (s) ⊦ D16 ≠ E13; (s) ⊦ D15 ≠ E13; (s) ⊦ D14 ≠ E13; (s) ⊦ D13 ≠ E13; (s) ⊦ D12 ≠ E13; (s) ⊦ D11 ≠ E13; (s) ⊦ D10 ≠ E13; (s) ⊦ D9 ≠ E13; (s) ⊦ D8 ≠ E13; (s) ⊦ D6 ≠ E13; (s) ⊦ D5 ≠ E13; (s) ⊦ D4 ≠ E13; (s) ⊦ D3 ≠ E13; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E13, a) = E4; (s) Used terms: gs, ls, E13

Proof step 826 from proof copied-step-DMSQLInv (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 827 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E13, a).vrvHp = dom gstepf(gs, ls, E13, a).prvHp, gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, gstepf(gs, ls, E13, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E13), allocrv(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp), allocrv(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp), listp(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps, gstepf(gs, ls, E13, a).owns), markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).ps), markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).vs), nextnottid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs), noid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs), nonullRetRefs (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).pretRefs), pre(gs, ls, E13, a), rvownerok(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp, gstepf(gs, ls, E13, a).rvowns), rvownerok(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp, gstepf(gs, ls, E13, a).rvowns), unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).ps), gstepf(gs, ls, E13, a).phead ∈ gstepf(gs, ls, E13, a).orl, ¬ dups(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl), gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ≠ null ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E13, a).rvowns (gstepf(gs, ls, E13, a).vretRefs(gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid, gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].val), ¬ lstepf(gs, ls, E13, a).success → ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).orl ∧ ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).qrl ∧ lstepf(gs, ls, E13, a).node ≠ null ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).ps ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).vs ∧ gstepf(gs, ls, E13, a).owns(lstepf(gs, ls, E13, a).node) = Some(lstepf(gs, ls, E13, a).tid) ∧ gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node] = mk(lstepf(gs, ls, E13, a).value, None, null) ∧ gstepf(gs, ls, E13, a).ps[lstepf(gs, ls, E13, a).node] = gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node], (lstepf(gs, ls, E13, a).success ⊃ noowns(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).owns) ;oneowns(lstepf(gs, ls, E13, a).tid, lstepf(gs, ls, E13, a).node, gstepf(gs, ls, E13, a).owns, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps) ), gstepf(gs, ls, E13, a).orl.last = gstepf(gs, ls, E13, a).vhead ∧ (gstepf(gs, ls, E13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E13, a).qrl.tail, gstepf(gs, ls, E13, a).vs)) ∨ gstepf(gs, ls, E13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E13, a).orl.butlast.last = gstepf(gs, ls, E13, a).vhead ∧ gstepf(gs, ls, E13, a).phead ≠ gstepf(gs, ls, E13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs), gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last ∨ gstepf(gs, ls, E13, a).qrl ≠ [] ∧ gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl.butlast).last ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E13, a).vs[(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 828 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 829 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E13, a).vrvHp = dom gstepf(gs, ls, E13, a).prvHp, gs0 = gstepf(gs, ls, E13, a), ls0 = lstepf(gs, ls, E13, a), pc0 = E4, gstepf(gs, ls, E13, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E13), allocrv(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp), allocrv(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp), listp(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps, gstepf(gs, ls, E13, a).owns), markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).vs), markedp(gstepf(gs, ls, E13, a).orl, gstepf(gs, ls, E13, a).ps), nextnottid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs), noid(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vhead, gstepf(gs, ls, E13, a).vs), nonullRetRefs (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).pretRefs), pre(gs, ls, E13, a), rvownerok(gstepf(gs, ls, E13, a).pretRefs, gstepf(gs, ls, E13, a).prvHp, gstepf(gs, ls, E13, a).rvowns), rvownerok(gstepf(gs, ls, E13, a).vretRefs, gstepf(gs, ls, E13, a).vrvHp, gstepf(gs, ls, E13, a).rvowns), unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).ps), gstepf(gs, ls, E13, a).phead ∈ gstepf(gs, ls, E13, a).orl, ¬ dups(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl), ¬ lstepf(gs, ls, E13, a).success → ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).orl ∧ ¬ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).qrl ∧ lstepf(gs, ls, E13, a).node ≠ null ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).ps ∧ lstepf(gs, ls, E13, a).node ∈ gstepf(gs, ls, E13, a).vs ∧ gstepf(gs, ls, E13, a).owns(lstepf(gs, ls, E13, a).node) = Some(lstepf(gs, ls, E13, a).tid) ∧ gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node] = mk(lstepf(gs, ls, E13, a).value, None, null) ∧ gstepf(gs, ls, E13, a).ps[lstepf(gs, ls, E13, a).node] = gstepf(gs, ls, E13, a).vs[lstepf(gs, ls, E13, a).node], gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next ≠ null ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E13, a).rvowns (gstepf(gs, ls, E13, a).vretRefs(gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].deqID.tid, gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).vhead].next].val), (lstepf(gs, ls, E13, a).success ⊃ noowns(lstepf(gs, ls, E13, a).tid, gstepf(gs, ls, E13, a).owns) ;oneowns(lstepf(gs, ls, E13, a).tid, lstepf(gs, ls, E13, a).node, gstepf(gs, ls, E13, a).owns, gstepf(gs, ls, E13, a).vs, gstepf(gs, ls, E13, a).ps) ), gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last ∨ gstepf(gs, ls, E13, a).qrl ≠ [] ∧ gstepf(gs, ls, E13, a).vtail = (gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl.butlast).last ∧ gstepf(gs, ls, E13, a).vs[gstepf(gs, ls, E13, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E13, a).vs[(gstepf(gs, ls, E13, a).orl + gstepf(gs, ls, E13, a).qrl).last].next = null, gstepf(gs, ls, E13, a).orl.last = gstepf(gs, ls, E13, a).vhead ∧ (gstepf(gs, ls, E13, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E13, a).qrl.tail, gstepf(gs, ls, E13, a).vs)) ∨ gstepf(gs, ls, E13, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E13, a).orl.butlast.last = gstepf(gs, ls, E13, a).vhead ∧ gstepf(gs, ls, E13, a).phead ≠ gstepf(gs, ls, E13, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E13, a).qrl, gstepf(gs, ls, E13, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E13, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ E5; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E11; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E13, τ) = gs; (s) ⊦ lstepf(gs, ls, E13, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 830 from proof copied-step-DMSQLInv (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 831 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E14, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 832 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = pcstepf(gs, ls, E14, a), DMSQGInv(gs), DMSQLInv(gs, ls, E14), pre(gs, ls, E14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E14, seq: ⊦ pcstepf(gs, ls, E14, a) = E15, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 833 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E14, a) = E15

A spec-lemma

Proof step 834 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, DMSQGInv(gs), DMSQLInv(gs, ls, E14), pre(gs, ls, E14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E14-E15, seq:⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → ( gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid) ∧ lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs) ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps) ∧ gstepf(gs, ls, E14, a).orl ≠ [] ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl ∧ rvownerok (gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv (gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv (gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp) ∧ dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp ∧ ( gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs [gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs (gstepf(gs, ls, E14, a).vs [gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E14, a).vs [gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E14, a).vs [gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ ( gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs)) ∧ ( gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = ( gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast ).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E14, a).vs [(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ).last ] .next = null)) ∧ ( lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps ∧ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs ∧ lstepf(gs, ls, E14, a).node ≠ null ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl) ∧ gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null) ∧ gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] ∧ ¬ lstepf(gs, ls, E14, a).success ∧ nextnottid (lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ noid (lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ oneowns (lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 835 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → ( gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid) ∧ lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs) ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps) ∧ gstepf(gs, ls, E14, a).orl ≠ [] ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl ∧ rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp) ∧ dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp ∧ ( gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs)) ∧ ( gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps ∧ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs ∧ lstepf(gs, ls, E14, a).node ≠ null ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl) ∧ gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null) ∧ gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] ∧ ¬ lstepf(gs, ls, E14, a).success ∧ nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ noid (lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ oneowns (lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps)

Lemma step-E14-E15

Proof step 836 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, DMSQGInv(gs), DMSQLInv(gs, ls, E14), pre(gs, ls, E14, a), ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15 → ( gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid) ∧ lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next ∧ lstepf(gs, ls, E14, a).nxt ≠ null) ∧ ( listp (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps) ∧ markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs) ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps) ∧ gstepf(gs, ls, E14, a).orl ≠ [] ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl ∧ rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns) ∧ allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp) ∧ dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp ∧ ( gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs)) ∧ ( gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null)) ∧ ( lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps ∧ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs ∧ lstepf(gs, ls, E14, a).node ≠ null ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl ∧ ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl) ∧ gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null) ∧ gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] ∧ ¬ lstepf(gs, ls, E14, a).success ∧ nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ noid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ oneowns (lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 837 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, DMSQGInv(gs), DMSQLInv(gs, ls, E14), pre(gs, ls, E14, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 838 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 839 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, gs.orl ≠ [], DMSQLInv(gs, ls, E14), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E14, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E14, a) ∧ pcstepf(gs, ls, E14, a) = E15, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E14], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E14; (s) ⊦ D2 ≠ E14; (s) ⊦ E14 ≠ E17; (s) ⊦ E14 ≠ crashed; (s) ⊦ E14 ≠ idle; (s) ⊦ E14 ≠ ready; (s) ⊦ E1 ≠ E14; (s) ⊦ D7 ≠ E14; (s) ⊦ D32 ≠ E14; (s) ⊦ D33 ≠ E14; (s) ⊦ E4 ≠ E14; (s) ⊦ E14 ≠ E16; (s) ⊦ E14 ≠ E15; (s) ⊦ E13 ≠ E14; (s) ⊦ E12 ≠ E14; (s) ⊦ E11 ≠ E14; (s) ⊦ E10 ≠ E14; (s) ⊦ E9 ≠ E14; (s) ⊦ E8 ≠ E14; (s) ⊦ E7 ≠ E14; (s) ⊦ E6 ≠ E14; (s) ⊦ E5 ≠ E14; (s) ⊦ E3 ≠ E14; (s) ⊦ E2 ≠ E14; (s) ⊦ D34 ≠ E14; (s) ⊦ D31 ≠ E14; (s) ⊦ D30 ≠ E14; (s) ⊦ D29 ≠ E14; (s) ⊦ D28 ≠ E14; (s) ⊦ D27 ≠ E14; (s) ⊦ D26 ≠ E14; (s) ⊦ D25 ≠ E14; (s) ⊦ D24 ≠ E14; (s) ⊦ D23 ≠ E14; (s) ⊦ D22 ≠ E14; (s) ⊦ D21 ≠ E14; (s) ⊦ D20 ≠ E14; (s) ⊦ D19 ≠ E14; (s) ⊦ D18 ≠ E14; (s) ⊦ D17 ≠ E14; (s) ⊦ D16 ≠ E14; (s) ⊦ D15 ≠ E14; (s) ⊦ D14 ≠ E14; (s) ⊦ D13 ≠ E14; (s) ⊦ D12 ≠ E14; (s) ⊦ D11 ≠ E14; (s) ⊦ D10 ≠ E14; (s) ⊦ D9 ≠ E14; (s) ⊦ D8 ≠ E14; (s) ⊦ D6 ≠ E14; (s) ⊦ D5 ≠ E14; (s) ⊦ D4 ≠ E14; (s) ⊦ D3 ≠ E14; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ pcstepf(gs, ls, E14, a) = E15; (s) Used terms: gs, ls, E14

Proof step 840 from proof copied-step-DMSQLInv (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 841 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next, lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next, gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid), gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null), gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node], dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp, gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, lstepf(gs, ls, E14, a).node ≠ null, lstepf(gs, ls, E14, a).nxt ≠ null, gstepf(gs, ls, E14, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E14), allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp), allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp), listp(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns), markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps), markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs), nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs), noid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs), nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs), oneowns(lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps), pre(gs, ls, E14, a), rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns), rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns), unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps), lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl, lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps, lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs, ¬ lstepf(gs, ls, E14, a).success, ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl), ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl, ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val), gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs), gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 842 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 843 from proof copied-step-DMSQLInv (previous step) (back to tree)

lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).lst].next, lstepf(gs, ls, E14, a).nxt = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).lst].next, gstepf(gs, ls, E14, a).owns(lstepf(gs, ls, E14, a).node) = Some(lstepf(gs, ls, E14, a).tid), gstepf(gs, ls, E14, a).ps[lstepf(gs, ls, E14, a).node] = gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node], gstepf(gs, ls, E14, a).vs[lstepf(gs, ls, E14, a).node] = mk(lstepf(gs, ls, E14, a).value, None, null), dom gstepf(gs, ls, E14, a).vrvHp = dom gstepf(gs, ls, E14, a).prvHp, gs0 = gstepf(gs, ls, E14, a), ls0 = lstepf(gs, ls, E14, a), pc0 = E15, lstepf(gs, ls, E14, a).node ≠ null, lstepf(gs, ls, E14, a).nxt ≠ null, gstepf(gs, ls, E14, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E14), allocrv(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp), allocrv(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp), listp(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns), markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs), markedp(gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).ps), nextnottid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs), noid(lstepf(gs, ls, E14, a).tid, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs), nonullRetRefs (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).pretRefs), oneowns(lstepf(gs, ls, E14, a).tid, lstepf(gs, ls, E14, a).node, gstepf(gs, ls, E14, a).owns, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps), pre(gs, ls, E14, a), rvownerok(gstepf(gs, ls, E14, a).pretRefs, gstepf(gs, ls, E14, a).prvHp, gstepf(gs, ls, E14, a).rvowns), rvownerok(gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp, gstepf(gs, ls, E14, a).rvowns), unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).ps), lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).vs, lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl, lstepf(gs, ls, E14, a).lst ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, ¬ lstepf(gs, ls, E14, a).success, ¬ dups(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl), ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).qrl, ¬ lstepf(gs, ls, E14, a).node ∈ gstepf(gs, ls, E14, a).orl, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next ≠ null ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E14, a).rvowns (gstepf(gs, ls, E14, a).vretRefs(gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].deqID.tid, gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).vhead].next].val), gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last ∨ gstepf(gs, ls, E14, a).qrl ≠ [] ∧ gstepf(gs, ls, E14, a).vtail = (gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl.butlast).last ∧ gstepf(gs, ls, E14, a).vs[gstepf(gs, ls, E14, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E14, a).vs[(gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl).last].next = null, gstepf(gs, ls, E14, a).orl.last = gstepf(gs, ls, E14, a).vhead ∧ (gstepf(gs, ls, E14, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E14, a).qrl.tail, gstepf(gs, ls, E14, a).vs)) ∨ gstepf(gs, ls, E14, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E14, a).orl.butlast.last = gstepf(gs, ls, E14, a).vhead ∧ gstepf(gs, ls, E14, a).phead ≠ gstepf(gs, ls, E14, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E14, a) ↔ a = (ls.lst = (gs.orl + gs.qrl).last ⊃ doEnq(gs.owns(ls.nxt).tid);τ); (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.ps:= ps).phead = gs.phead; (s) ⊦ (gs.owns:= owns).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ E15 ≠ E16; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ E15 ≠ crashed; (s) ⊦ E15 ≠ idle; (s) ⊦ E15 ≠ ready; (s) ⊦ D1 ≠ E15; (s) ⊦ D2 ≠ E15; (s) ⊦ D3 ≠ E15; (s) ⊦ D4 ≠ E15; (s) ⊦ D5 ≠ E15; (s) ⊦ D6 ≠ E15; (s) ⊦ D7 ≠ E15; (s) ⊦ D8 ≠ E15; (s) ⊦ D9 ≠ E15; (s) ⊦ D10 ≠ E15; (s) ⊦ D11 ≠ E15; (s) ⊦ D12 ≠ E15; (s) ⊦ D13 ≠ E15; (s) ⊦ D14 ≠ E15; (s) ⊦ D15 ≠ E15; (s) ⊦ D16 ≠ E15; (s) ⊦ D17 ≠ E15; (s) ⊦ D18 ≠ E15; (s) ⊦ D19 ≠ E15; (s) ⊦ D20 ≠ E15; (s) ⊦ D21 ≠ E15; (s) ⊦ D22 ≠ E15; (s) ⊦ D23 ≠ E15; (s) ⊦ D24 ≠ E15; (s) ⊦ D25 ≠ E15; (s) ⊦ D26 ≠ E15; (s) ⊦ D27 ≠ E15; (s) ⊦ D28 ≠ E15; (s) ⊦ D29 ≠ E15; (s) ⊦ D30 ≠ E15; (s) ⊦ D31 ≠ E15; (s) ⊦ D32 ≠ E15; (s) ⊦ D33 ≠ E15; (s) ⊦ D34 ≠ E15; (s) ⊦ E1 ≠ E15; (s) ⊦ E12 ≠ E15; (s) ⊦ E15 ≠ E17; (s) ⊦ E2 ≠ E15; (s) ⊦ E3 ≠ E15; (s) ⊦ E5 ≠ E15; (s) ⊦ E6 ≠ E15; (s) ⊦ E7 ≠ E15; (s) ⊦ E8 ≠ E15; (s) ⊦ E9 ≠ E15; (s) ⊦ E13 ≠ E15; (s) ⊦ E14 ≠ E15; (s) ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ gstepf(gs, ls, E14, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.qrl + gs.vs[ls.lst].next ;gs.qrl )) .owns:= (ls.lst = (gs.orl + gs.qrl).last ⊃ gs.owns(gs.vs[ls.lst].next; None) ;gs.owns ); (s) ⊦ x + a = x + a '; (s) ⊦ (gs.owns:= owns).ps = gs.ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ E10 ≠ E15; (s) ⊦ E11 ≠ E15; (s) ⊦ E4 ≠ E15; (s) ⊦ lstepf(gs, ls, E14, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 844 from proof copied-step-DMSQLInv (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 845 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E15, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 846 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = pcstepf(gs, ls, E15, a), DMSQGInv(gs), DMSQLInv(gs, ls, E15), pre(gs, ls, E15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E15, seq: ⊦ pcstepf(gs, ls, E15, a) = E4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 847 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E15, a) = E4

A spec-lemma

Proof step 848 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E15), pre(gs, ls, E15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E15-E4, seq:⊦ ( ( 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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → ( listp (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs) ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps) ∧ gstepf(gs, ls, E15, a).orl ≠ [] ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl ∧ rvownerok (gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv (gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv (gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp) ∧ dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp ∧ ( gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs [gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs (gstepf(gs, ls, E15, a).vs [gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E15, a).vs [gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E15, a).vs [gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ ( gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs)) ∧ ( gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = ( gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast ).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E15, a).vs [(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node]) ∧ nextnottid (lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ noid (lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns (lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 849 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( (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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → ( listp (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs) ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps) ∧ gstepf(gs, ls, E15, a).orl ≠ [] ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl ∧ rvownerok(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp) ∧ dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp ∧ ( gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs(gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid, gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ (gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs)) ∧ ( gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E15, a).vs[(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node]) ∧ nextnottid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ noid (lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns (lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) )

Lemma step-E15-E4

Proof step 850 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E15), pre(gs, ls, E15, a), ( (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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → ( listp (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps) ∧ markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs) ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps) ∧ gstepf(gs, ls, E15, a).orl ≠ [] ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl ∧ rvownerok(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns) ∧ allocrv(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp) ∧ dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp ∧ ( gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs(gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid, gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ (gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs)) ∧ ( gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E15, a).vs[(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node]) ∧ nextnottid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ noid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns (lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 851 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E15), pre(gs, ls, E15, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( (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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 852 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 853 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, gs.orl ≠ [], DMSQLInv(gs, ls, E15), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E15, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( (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) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E15], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E15; (s) ⊦ D2 ≠ E15; (s) ⊦ E15 ≠ E17; (s) ⊦ E15 ≠ crashed; (s) ⊦ E15 ≠ idle; (s) ⊦ E15 ≠ ready; (s) ⊦ E1 ≠ E15; (s) ⊦ D7 ≠ E15; (s) ⊦ D32 ≠ E15; (s) ⊦ D33 ≠ E15; (s) ⊦ E4 ≠ E15; (s) ⊦ E15 ≠ E16; (s) ⊦ E14 ≠ E15; (s) ⊦ E13 ≠ E15; (s) ⊦ E12 ≠ E15; (s) ⊦ E11 ≠ E15; (s) ⊦ E10 ≠ E15; (s) ⊦ E9 ≠ E15; (s) ⊦ E8 ≠ E15; (s) ⊦ E7 ≠ E15; (s) ⊦ E6 ≠ E15; (s) ⊦ E5 ≠ E15; (s) ⊦ E3 ≠ E15; (s) ⊦ E2 ≠ E15; (s) ⊦ D34 ≠ E15; (s) ⊦ D31 ≠ E15; (s) ⊦ D30 ≠ E15; (s) ⊦ D29 ≠ E15; (s) ⊦ D28 ≠ E15; (s) ⊦ D27 ≠ E15; (s) ⊦ D26 ≠ E15; (s) ⊦ D25 ≠ E15; (s) ⊦ D24 ≠ E15; (s) ⊦ D23 ≠ E15; (s) ⊦ D22 ≠ E15; (s) ⊦ D21 ≠ E15; (s) ⊦ D20 ≠ E15; (s) ⊦ D19 ≠ E15; (s) ⊦ D18 ≠ E15; (s) ⊦ D17 ≠ E15; (s) ⊦ D16 ≠ E15; (s) ⊦ D15 ≠ E15; (s) ⊦ D14 ≠ E15; (s) ⊦ D13 ≠ E15; (s) ⊦ D12 ≠ E15; (s) ⊦ D11 ≠ E15; (s) ⊦ D10 ≠ E15; (s) ⊦ D9 ≠ E15; (s) ⊦ D8 ≠ E15; (s) ⊦ D6 ≠ E15; (s) ⊦ D5 ≠ E15; (s) ⊦ D4 ≠ E15; (s) ⊦ D3 ≠ E15; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E15, a) = E4; (s) Used terms: gs, ls, E15

Proof step 854 from proof copied-step-DMSQLInv (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 855 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp, gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, gstepf(gs, ls, E15, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E15), allocrv(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp), allocrv(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp), listp(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns), markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps), markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs), nextnottid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs), noid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs), nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs), pre(gs, ls, E15, a), rvownerok(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns), rvownerok(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns), unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps), gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl, ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl), gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs(gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid, gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].val), ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node], (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns(lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ), gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ (gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs), gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E15, a).vs[(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 856 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 857 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E15, a).vrvHp = dom gstepf(gs, ls, E15, a).prvHp, gs0 = gstepf(gs, ls, E15, a), ls0 = lstepf(gs, ls, E15, a), pc0 = E4, gstepf(gs, ls, E15, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E15), allocrv(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp), allocrv(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp), listp(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns), markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).vs), markedp(gstepf(gs, ls, E15, a).orl, gstepf(gs, ls, E15, a).ps), nextnottid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs), noid(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs), nonullRetRefs (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).pretRefs), pre(gs, ls, E15, a), rvownerok(gstepf(gs, ls, E15, a).pretRefs, gstepf(gs, ls, E15, a).prvHp, gstepf(gs, ls, E15, a).rvowns), rvownerok(gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp, gstepf(gs, ls, E15, a).rvowns), unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).ps), gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl, ¬ dups(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl), ¬ lstepf(gs, ls, E15, a).success → ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).orl ∧ ¬ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).qrl ∧ lstepf(gs, ls, E15, a).node ≠ null ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).ps ∧ lstepf(gs, ls, E15, a).node ∈ gstepf(gs, ls, E15, a).vs ∧ gstepf(gs, ls, E15, a).owns(lstepf(gs, ls, E15, a).node) = Some(lstepf(gs, ls, E15, a).tid) ∧ gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node] = mk(lstepf(gs, ls, E15, a).value, None, null) ∧ gstepf(gs, ls, E15, a).ps[lstepf(gs, ls, E15, a).node] = gstepf(gs, ls, E15, a).vs[lstepf(gs, ls, E15, a).node], gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next ≠ null ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E15, a).rvowns (gstepf(gs, ls, E15, a).vretRefs(gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].deqID.tid, gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).vhead].next].val), (lstepf(gs, ls, E15, a).success ⊃ noowns(lstepf(gs, ls, E15, a).tid, gstepf(gs, ls, E15, a).owns) ;oneowns(lstepf(gs, ls, E15, a).tid, lstepf(gs, ls, E15, a).node, gstepf(gs, ls, E15, a).owns, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ), gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last ∨ gstepf(gs, ls, E15, a).qrl ≠ [] ∧ gstepf(gs, ls, E15, a).vtail = (gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl.butlast).last ∧ gstepf(gs, ls, E15, a).vs[gstepf(gs, ls, E15, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E15, a).vs[(gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl).last].next = null, gstepf(gs, ls, E15, a).orl.last = gstepf(gs, ls, E15, a).vhead ∧ (gstepf(gs, ls, E15, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E15, a).qrl.tail, gstepf(gs, ls, E15, a).vs)) ∨ gstepf(gs, ls, E15, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E15, a).orl.butlast.last = gstepf(gs, ls, E15, a).vhead ∧ gstepf(gs, ls, E15, a).phead ≠ gstepf(gs, ls, E15, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ E5; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E11; (s) ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ lstepf(gs, ls, E15, a) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 858 from proof copied-step-DMSQLInv (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 859 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E16, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 860 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = pcstepf(gs, ls, E16, a), DMSQGInv(gs), DMSQLInv(gs, ls, E16), pre(gs, ls, E16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E16, seq: ⊦ pcstepf(gs, ls, E16, a) = E4, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 861 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E16, a) = E4

A spec-lemma

Proof step 862 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E16), pre(gs, ls, E16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E16-E4, seq:⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E16, a) ∧ pcstepf(gs, ls, E16, a) = E4 → ( listp (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps, gstepf(gs, ls, E16, a).owns) ∧ ¬ dups(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).ps) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).vs) ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).ps) ∧ gstepf(gs, ls, E16, a).orl ≠ [] ∧ gstepf(gs, ls, E16, a).phead ∈ gstepf(gs, ls, E16, a).orl ∧ rvownerok (gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv (gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv (gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp) ∧ dom gstepf(gs, ls, E16, a).vrvHp = dom gstepf(gs, ls, E16, a).prvHp ∧ ( gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ≠ null ∧ gstepf(gs, ls, E16, a).vs [gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E16, a).rvowns (gstepf(gs, ls, E16, a).vretRefs (gstepf(gs, ls, E16, a).vs [gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E16, a).vs [gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E16, a).vs [gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E16, a).orl.last = gstepf(gs, ls, E16, a).vhead ∧ ( gstepf(gs, ls, E16, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E16, a).qrl.tail, gstepf(gs, ls, E16, a).vs)) ∨ gstepf(gs, ls, E16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E16, a).orl.butlast.last = gstepf(gs, ls, E16, a).vhead ∧ gstepf(gs, ls, E16, a).phead ≠ gstepf(gs, ls, E16, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs)) ∧ ( gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last ∨ gstepf(gs, ls, E16, a).qrl ≠ [] ∧ gstepf(gs, ls, E16, a).vtail = ( gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl.butlast ).last ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E16, a).vs [(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl ).last ] .next = null)) ∧ ( ¬ lstepf(gs, ls, E16, a).success → ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).orl ∧ ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).qrl ∧ lstepf(gs, ls, E16, a).node ≠ null ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).ps ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).vs ∧ gstepf(gs, ls, E16, a).owns(lstepf(gs, ls, E16, a).node) = Some(lstepf(gs, ls, E16, a).tid) ∧ gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node] = mk(lstepf(gs, ls, E16, a).value, None, null) ∧ gstepf(gs, ls, E16, a).ps[lstepf(gs, ls, E16, a).node] = gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node]) ∧ nextnottid (lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ noid (lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ (lstepf(gs, ls, E16, a).success ⊃ noowns(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).owns) ;oneowns (lstepf(gs, ls, E16, a).tid, lstepf(gs, ls, E16, a).node, gstepf(gs, ls, E16, a).owns, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps) ), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 863 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E16, a) ∧ pcstepf(gs, ls, E16, a) = E4 → ( listp (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps, gstepf(gs, ls, E16, a).owns) ∧ ¬ dups(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).ps) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).vs) ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).ps) ∧ gstepf(gs, ls, E16, a).orl ≠ [] ∧ gstepf(gs, ls, E16, a).phead ∈ gstepf(gs, ls, E16, a).orl ∧ rvownerok(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp) ∧ dom gstepf(gs, ls, E16, a).vrvHp = dom gstepf(gs, ls, E16, a).prvHp ∧ ( gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ≠ null ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E16, a).rvowns (gstepf(gs, ls, E16, a).vretRefs(gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid, gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E16, a).orl.last = gstepf(gs, ls, E16, a).vhead ∧ (gstepf(gs, ls, E16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E16, a).qrl.tail, gstepf(gs, ls, E16, a).vs)) ∨ gstepf(gs, ls, E16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E16, a).orl.butlast.last = gstepf(gs, ls, E16, a).vhead ∧ gstepf(gs, ls, E16, a).phead ≠ gstepf(gs, ls, E16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs)) ∧ ( gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last ∨ gstepf(gs, ls, E16, a).qrl ≠ [] ∧ gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl.butlast).last ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E16, a).vs[(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E16, a).success → ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).orl ∧ ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).qrl ∧ lstepf(gs, ls, E16, a).node ≠ null ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).ps ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).vs ∧ gstepf(gs, ls, E16, a).owns(lstepf(gs, ls, E16, a).node) = Some(lstepf(gs, ls, E16, a).tid) ∧ gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node] = mk(lstepf(gs, ls, E16, a).value, None, null) ∧ gstepf(gs, ls, E16, a).ps[lstepf(gs, ls, E16, a).node] = gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node]) ∧ nextnottid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ noid (lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ (lstepf(gs, ls, E16, a).success ⊃ noowns(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).owns) ;oneowns (lstepf(gs, ls, E16, a).tid, lstepf(gs, ls, E16, a).node, gstepf(gs, ls, E16, a).owns, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps) )

Lemma step-E16-E4

Proof step 864 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E16), pre(gs, ls, E16, a), ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E16, a) ∧ pcstepf(gs, ls, E16, a) = E4 → ( listp (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps, gstepf(gs, ls, E16, a).owns) ∧ ¬ dups(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).ps) ∧ markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).vs) ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).ps) ∧ gstepf(gs, ls, E16, a).orl ≠ [] ∧ gstepf(gs, ls, E16, a).phead ∈ gstepf(gs, ls, E16, a).orl ∧ rvownerok(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp, gstepf(gs, ls, E16, a).rvowns) ∧ allocrv(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp) ∧ dom gstepf(gs, ls, E16, a).vrvHp = dom gstepf(gs, ls, E16, a).prvHp ∧ ( gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ≠ null ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E16, a).rvowns (gstepf(gs, ls, E16, a).vretRefs(gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid, gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E16, a).orl.last = gstepf(gs, ls, E16, a).vhead ∧ (gstepf(gs, ls, E16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E16, a).qrl.tail, gstepf(gs, ls, E16, a).vs)) ∨ gstepf(gs, ls, E16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E16, a).orl.butlast.last = gstepf(gs, ls, E16, a).vhead ∧ gstepf(gs, ls, E16, a).phead ≠ gstepf(gs, ls, E16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs)) ∧ ( gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last ∨ gstepf(gs, ls, E16, a).qrl ≠ [] ∧ gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl.butlast).last ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E16, a).vs[(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E16, a).success → ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).orl ∧ ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).qrl ∧ lstepf(gs, ls, E16, a).node ≠ null ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).ps ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).vs ∧ gstepf(gs, ls, E16, a).owns(lstepf(gs, ls, E16, a).node) = Some(lstepf(gs, ls, E16, a).tid) ∧ gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node] = mk(lstepf(gs, ls, E16, a).value, None, null) ∧ gstepf(gs, ls, E16, a).ps[lstepf(gs, ls, E16, a).node] = gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node]) ∧ nextnottid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ noid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs) ∧ (lstepf(gs, ls, E16, a).success ⊃ noowns(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).owns) ;oneowns (lstepf(gs, ls, E16, a).tid, lstepf(gs, ls, E16, a).node, gstepf(gs, ls, E16, a).owns, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps) ) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 865 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, DMSQGInv(gs), DMSQLInv(gs, ls, E16), pre(gs, ls, E16, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E16, a) ∧ pcstepf(gs, ls, E16, a) = E4

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 866 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 867 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, gs.orl ≠ [], DMSQLInv(gs, ls, E16), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E16, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( gs.owns(ls.node) = Some(ls.tid) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E16, a) ∧ pcstepf(gs, ls, E16, a) = E4, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E16], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E16; (s) ⊦ D2 ≠ E16; (s) ⊦ E16 ≠ E17; (s) ⊦ E16 ≠ crashed; (s) ⊦ E16 ≠ idle; (s) ⊦ E16 ≠ ready; (s) ⊦ E1 ≠ E16; (s) ⊦ D7 ≠ E16; (s) ⊦ D32 ≠ E16; (s) ⊦ D33 ≠ E16; (s) ⊦ E4 ≠ E16; (s) ⊦ E15 ≠ E16; (s) ⊦ E14 ≠ E16; (s) ⊦ E13 ≠ E16; (s) ⊦ E12 ≠ E16; (s) ⊦ E11 ≠ E16; (s) ⊦ E10 ≠ E16; (s) ⊦ E9 ≠ E16; (s) ⊦ E8 ≠ E16; (s) ⊦ E7 ≠ E16; (s) ⊦ E6 ≠ E16; (s) ⊦ E5 ≠ E16; (s) ⊦ E3 ≠ E16; (s) ⊦ E2 ≠ E16; (s) ⊦ D34 ≠ E16; (s) ⊦ D31 ≠ E16; (s) ⊦ D30 ≠ E16; (s) ⊦ D29 ≠ E16; (s) ⊦ D28 ≠ E16; (s) ⊦ D27 ≠ E16; (s) ⊦ D26 ≠ E16; (s) ⊦ D25 ≠ E16; (s) ⊦ D24 ≠ E16; (s) ⊦ D23 ≠ E16; (s) ⊦ D22 ≠ E16; (s) ⊦ D21 ≠ E16; (s) ⊦ D20 ≠ E16; (s) ⊦ D19 ≠ E16; (s) ⊦ D18 ≠ E16; (s) ⊦ D17 ≠ E16; (s) ⊦ D16 ≠ E16; (s) ⊦ D15 ≠ E16; (s) ⊦ D14 ≠ E16; (s) ⊦ D13 ≠ E16; (s) ⊦ D12 ≠ E16; (s) ⊦ D11 ≠ E16; (s) ⊦ D10 ≠ E16; (s) ⊦ D9 ≠ E16; (s) ⊦ D8 ≠ E16; (s) ⊦ D6 ≠ E16; (s) ⊦ D5 ≠ E16; (s) ⊦ D4 ≠ E16; (s) ⊦ D3 ≠ E16; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E16, a) = E4; (s) Used terms: gs, ls, E16

Proof step 868 from proof copied-step-DMSQLInv (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 869 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E16, a).vrvHp = dom gstepf(gs, ls, E16, a).prvHp, gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, gstepf(gs, ls, E16, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E16), allocrv(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp), allocrv(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp), listp(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps, gstepf(gs, ls, E16, a).owns), markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).ps), markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).vs), nextnottid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs), noid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs), nonullRetRefs (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).pretRefs), pre(gs, ls, E16, a), rvownerok(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp, gstepf(gs, ls, E16, a).rvowns), rvownerok(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp, gstepf(gs, ls, E16, a).rvowns), unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).ps), gstepf(gs, ls, E16, a).phead ∈ gstepf(gs, ls, E16, a).orl, ¬ dups(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl), gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ≠ null ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E16, a).rvowns (gstepf(gs, ls, E16, a).vretRefs(gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid, gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].val), ¬ lstepf(gs, ls, E16, a).success → ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).orl ∧ ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).qrl ∧ lstepf(gs, ls, E16, a).node ≠ null ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).ps ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).vs ∧ gstepf(gs, ls, E16, a).owns(lstepf(gs, ls, E16, a).node) = Some(lstepf(gs, ls, E16, a).tid) ∧ gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node] = mk(lstepf(gs, ls, E16, a).value, None, null) ∧ gstepf(gs, ls, E16, a).ps[lstepf(gs, ls, E16, a).node] = gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node], (lstepf(gs, ls, E16, a).success ⊃ noowns(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).owns) ;oneowns(lstepf(gs, ls, E16, a).tid, lstepf(gs, ls, E16, a).node, gstepf(gs, ls, E16, a).owns, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps) ), gstepf(gs, ls, E16, a).orl.last = gstepf(gs, ls, E16, a).vhead ∧ (gstepf(gs, ls, E16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E16, a).qrl.tail, gstepf(gs, ls, E16, a).vs)) ∨ gstepf(gs, ls, E16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E16, a).orl.butlast.last = gstepf(gs, ls, E16, a).vhead ∧ gstepf(gs, ls, E16, a).phead ≠ gstepf(gs, ls, E16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs), gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last ∨ gstepf(gs, ls, E16, a).qrl ≠ [] ∧ gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl.butlast).last ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E16, a).vs[(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 870 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 871 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E16, a).vrvHp = dom gstepf(gs, ls, E16, a).prvHp, gs0 = gstepf(gs, ls, E16, a), ls0 = lstepf(gs, ls, E16, a), pc0 = E4, gstepf(gs, ls, E16, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E16), allocrv(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp), allocrv(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp), listp(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps, gstepf(gs, ls, E16, a).owns), markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).vs), markedp(gstepf(gs, ls, E16, a).orl, gstepf(gs, ls, E16, a).ps), nextnottid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs), noid(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vhead, gstepf(gs, ls, E16, a).vs), nonullRetRefs (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).pretRefs), pre(gs, ls, E16, a), rvownerok(gstepf(gs, ls, E16, a).pretRefs, gstepf(gs, ls, E16, a).prvHp, gstepf(gs, ls, E16, a).rvowns), rvownerok(gstepf(gs, ls, E16, a).vretRefs, gstepf(gs, ls, E16, a).vrvHp, gstepf(gs, ls, E16, a).rvowns), unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).ps), gstepf(gs, ls, E16, a).phead ∈ gstepf(gs, ls, E16, a).orl, ¬ dups(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl), ¬ lstepf(gs, ls, E16, a).success → ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).orl ∧ ¬ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).qrl ∧ lstepf(gs, ls, E16, a).node ≠ null ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).ps ∧ lstepf(gs, ls, E16, a).node ∈ gstepf(gs, ls, E16, a).vs ∧ gstepf(gs, ls, E16, a).owns(lstepf(gs, ls, E16, a).node) = Some(lstepf(gs, ls, E16, a).tid) ∧ gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node] = mk(lstepf(gs, ls, E16, a).value, None, null) ∧ gstepf(gs, ls, E16, a).ps[lstepf(gs, ls, E16, a).node] = gstepf(gs, ls, E16, a).vs[lstepf(gs, ls, E16, a).node], gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next ≠ null ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E16, a).rvowns (gstepf(gs, ls, E16, a).vretRefs(gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].deqID.tid, gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).vhead].next].val), (lstepf(gs, ls, E16, a).success ⊃ noowns(lstepf(gs, ls, E16, a).tid, gstepf(gs, ls, E16, a).owns) ;oneowns(lstepf(gs, ls, E16, a).tid, lstepf(gs, ls, E16, a).node, gstepf(gs, ls, E16, a).owns, gstepf(gs, ls, E16, a).vs, gstepf(gs, ls, E16, a).ps) ), gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last ∨ gstepf(gs, ls, E16, a).qrl ≠ [] ∧ gstepf(gs, ls, E16, a).vtail = (gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl.butlast).last ∧ gstepf(gs, ls, E16, a).vs[gstepf(gs, ls, E16, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E16, a).vs[(gstepf(gs, ls, E16, a).orl + gstepf(gs, ls, E16, a).qrl).last].next = null, gstepf(gs, ls, E16, a).orl.last = gstepf(gs, ls, E16, a).vhead ∧ (gstepf(gs, ls, E16, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E16, a).qrl.tail, gstepf(gs, ls, E16, a).vs)) ∨ gstepf(gs, ls, E16, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E16, a).orl.butlast.last = gstepf(gs, ls, E16, a).vhead ∧ gstepf(gs, ls, E16, a).phead ≠ gstepf(gs, ls, E16, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E16, a).qrl, gstepf(gs, ls, E16, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E16, a) ↔ a = τ; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ E4 ≠ crashed; (s) ⊦ E4 ≠ idle; (s) ⊦ E4 ≠ ready; (s) ⊦ D1 ≠ E4; (s) ⊦ D2 ≠ E4; (s) ⊦ D3 ≠ E4; (s) ⊦ D4 ≠ E4; (s) ⊦ D5 ≠ E4; (s) ⊦ D6 ≠ E4; (s) ⊦ D7 ≠ E4; (s) ⊦ D8 ≠ E4; (s) ⊦ D9 ≠ E4; (s) ⊦ D10 ≠ E4; (s) ⊦ D11 ≠ E4; (s) ⊦ D12 ≠ E4; (s) ⊦ D13 ≠ E4; (s) ⊦ D14 ≠ E4; (s) ⊦ D15 ≠ E4; (s) ⊦ D16 ≠ E4; (s) ⊦ D17 ≠ E4; (s) ⊦ D18 ≠ E4; (s) ⊦ D19 ≠ E4; (s) ⊦ D20 ≠ E4; (s) ⊦ D21 ≠ E4; (s) ⊦ D22 ≠ E4; (s) ⊦ D23 ≠ E4; (s) ⊦ D24 ≠ E4; (s) ⊦ D25 ≠ E4; (s) ⊦ D26 ≠ E4; (s) ⊦ D27 ≠ E4; (s) ⊦ D28 ≠ E4; (s) ⊦ D29 ≠ E4; (s) ⊦ D30 ≠ E4; (s) ⊦ D31 ≠ E4; (s) ⊦ D32 ≠ E4; (s) ⊦ D33 ≠ E4; (s) ⊦ D34 ≠ E4; (s) ⊦ E1 ≠ E4; (s) ⊦ E4 ≠ E12; (s) ⊦ E4 ≠ E17; (s) ⊦ E2 ≠ E4; (s) ⊦ E3 ≠ E4; (s) ⊦ E4 ≠ E5; (s) ⊦ E4 ≠ E6; (s) ⊦ E4 ≠ E7; (s) ⊦ E4 ≠ E8; (s) ⊦ E4 ≠ E9; (s) ⊦ E4 ≠ E13; (s) ⊦ E4 ≠ E14; (s) ⊦ E4 ≠ E15; (s) ⊦ E4 ≠ E16; (s) ⊦ E4 ≠ E10; (s) ⊦ E4 ≠ E11; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E16, τ) = gs; (s) ⊦ lstepf(gs, ls, E16, τ) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 872 from proof copied-step-DMSQLInv (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 873 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = E17, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 874 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = pcstepf(gs, ls, E17, a), DMSQGInv(gs), DMSQLInv(gs, ls, E17), pre(gs, ls, E17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pcstepf-E17, seq: ⊦ pcstepf(gs, ls, E17, a) = ready, subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 875 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pcstepf(gs, ls, E17, a) = ready

A spec-lemma

Proof step 876 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, E17), pre(gs, ls, E17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-E17-ready, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E17, a) ∧ pcstepf(gs, ls, E17, a) = ready → ( listp (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).ps, gstepf(gs, ls, E17, a).owns) ∧ ¬ dups(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).ps) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).vs) ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).ps) ∧ gstepf(gs, ls, E17, a).orl ≠ [] ∧ gstepf(gs, ls, E17, a).phead ∈ gstepf(gs, ls, E17, a).orl ∧ rvownerok (gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv (gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv (gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp) ∧ dom gstepf(gs, ls, E17, a).vrvHp = dom gstepf(gs, ls, E17, a).prvHp ∧ ( gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ≠ null ∧ gstepf(gs, ls, E17, a).vs [gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, E17, a).rvowns (gstepf(gs, ls, E17, a).vretRefs (gstepf(gs, ls, E17, a).vs [gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, E17, a).vs [gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ] .deqID .tid, gstepf(gs, ls, E17, a).vs [gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ] .val)) ∧ ( gstepf(gs, ls, E17, a).orl.last = gstepf(gs, ls, E17, a).vhead ∧ ( gstepf(gs, ls, E17, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, E17, a).qrl.tail, gstepf(gs, ls, E17, a).vs)) ∨ gstepf(gs, ls, E17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E17, a).orl.butlast.last = gstepf(gs, ls, E17, a).vhead ∧ gstepf(gs, ls, E17, a).phead ≠ gstepf(gs, ls, E17, a).orl.last ∧ unmarkedp (gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs)) ∧ ( gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last ∨ gstepf(gs, ls, E17, a).qrl ≠ [] ∧ gstepf(gs, ls, E17, a).vtail = ( gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl.butlast ).last ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, E17, a).vs [(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noid (lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noowns(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 877 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E17, a) ∧ pcstepf(gs, ls, E17, a) = ready → ( listp (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).ps, gstepf(gs, ls, E17, a).owns) ∧ ¬ dups(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).ps) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).vs) ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).ps) ∧ gstepf(gs, ls, E17, a).orl ≠ [] ∧ gstepf(gs, ls, E17, a).phead ∈ gstepf(gs, ls, E17, a).orl ∧ rvownerok(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp) ∧ dom gstepf(gs, ls, E17, a).vrvHp = dom gstepf(gs, ls, E17, a).prvHp ∧ ( gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ≠ null ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E17, a).rvowns (gstepf(gs, ls, E17, a).vretRefs(gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid, gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E17, a).orl.last = gstepf(gs, ls, E17, a).vhead ∧ (gstepf(gs, ls, E17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E17, a).qrl.tail, gstepf(gs, ls, E17, a).vs)) ∨ gstepf(gs, ls, E17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E17, a).orl.butlast.last = gstepf(gs, ls, E17, a).vhead ∧ gstepf(gs, ls, E17, a).phead ≠ gstepf(gs, ls, E17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs)) ∧ ( gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last ∨ gstepf(gs, ls, E17, a).qrl ≠ [] ∧ gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl.butlast).last ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E17, a).vs[(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noid (lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noowns(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).owns)

Lemma step-E17-ready

Proof step 878 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, E17), pre(gs, ls, E17, a), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E17, a) ∧ pcstepf(gs, ls, E17, a) = ready → ( listp (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).ps, gstepf(gs, ls, E17, a).owns) ∧ ¬ dups(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).ps) ∧ markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).vs) ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).ps) ∧ gstepf(gs, ls, E17, a).orl ≠ [] ∧ gstepf(gs, ls, E17, a).phead ∈ gstepf(gs, ls, E17, a).orl ∧ rvownerok(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp, gstepf(gs, ls, E17, a).rvowns) ∧ allocrv(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp) ∧ dom gstepf(gs, ls, E17, a).vrvHp = dom gstepf(gs, ls, E17, a).prvHp ∧ ( gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ≠ null ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E17, a).rvowns (gstepf(gs, ls, E17, a).vretRefs(gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid, gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E17, a).orl.last = gstepf(gs, ls, E17, a).vhead ∧ (gstepf(gs, ls, E17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E17, a).qrl.tail, gstepf(gs, ls, E17, a).vs)) ∨ gstepf(gs, ls, E17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E17, a).orl.butlast.last = gstepf(gs, ls, E17, a).vhead ∧ gstepf(gs, ls, E17, a).phead ≠ gstepf(gs, ls, E17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs)) ∧ ( gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last ∨ gstepf(gs, ls, E17, a).qrl ≠ [] ∧ gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl.butlast).last ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E17, a).vs[(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs) ∧ noowns(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 879 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, DMSQGInv(gs), DMSQLInv(gs, ls, E17), pre(gs, ls, E17, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E17, a) ∧ pcstepf(gs, ls, E17, a) = ready

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 880 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 881 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, gs.orl ≠ [], DMSQLInv(gs, ls, E17), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), pre(gs, ls, E17, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, E17, a) ∧ pcstepf(gs, ls, E17, a) = ready, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, E17], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ E17; (s) ⊦ D2 ≠ E17; (s) ⊦ E17 ≠ crashed; (s) ⊦ E17 ≠ idle; (s) ⊦ E17 ≠ ready; (s) ⊦ E1 ≠ E17; (s) ⊦ D7 ≠ E17; (s) ⊦ D32 ≠ E17; (s) ⊦ D33 ≠ E17; (s) ⊦ E4 ≠ E17; (s) ⊦ E16 ≠ E17; (s) ⊦ E15 ≠ E17; (s) ⊦ E14 ≠ E17; (s) ⊦ E13 ≠ E17; (s) ⊦ E12 ≠ E17; (s) ⊦ E11 ≠ E17; (s) ⊦ E10 ≠ E17; (s) ⊦ E9 ≠ E17; (s) ⊦ E8 ≠ E17; (s) ⊦ E7 ≠ E17; (s) ⊦ E6 ≠ E17; (s) ⊦ E5 ≠ E17; (s) ⊦ E3 ≠ E17; (s) ⊦ E2 ≠ E17; (s) ⊦ D34 ≠ E17; (s) ⊦ D31 ≠ E17; (s) ⊦ D30 ≠ E17; (s) ⊦ D29 ≠ E17; (s) ⊦ D28 ≠ E17; (s) ⊦ D27 ≠ E17; (s) ⊦ D26 ≠ E17; (s) ⊦ D25 ≠ E17; (s) ⊦ D24 ≠ E17; (s) ⊦ D23 ≠ E17; (s) ⊦ D22 ≠ E17; (s) ⊦ D21 ≠ E17; (s) ⊦ D20 ≠ E17; (s) ⊦ D19 ≠ E17; (s) ⊦ D18 ≠ E17; (s) ⊦ D17 ≠ E17; (s) ⊦ D16 ≠ E17; (s) ⊦ D15 ≠ E17; (s) ⊦ D14 ≠ E17; (s) ⊦ D13 ≠ E17; (s) ⊦ D12 ≠ E17; (s) ⊦ D11 ≠ E17; (s) ⊦ D10 ≠ E17; (s) ⊦ D9 ≠ E17; (s) ⊦ D8 ≠ E17; (s) ⊦ D6 ≠ E17; (s) ⊦ D5 ≠ E17; (s) ⊦ D4 ≠ E17; (s) ⊦ D3 ≠ E17; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ pcstepf(gs, ls, E17, a) = ready; (s) Used terms: gs, ls, E17

Proof step 882 from proof copied-step-DMSQLInv (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 883 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E17, a).vrvHp = dom gstepf(gs, ls, E17, a).prvHp, gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, gstepf(gs, ls, E17, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E17), allocrv(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp), allocrv(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp), listp(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).ps, gstepf(gs, ls, E17, a).owns), markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).ps), markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).vs), nextnottid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs), noid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs), nonullRetRefs (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).pretRefs), noowns(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).owns), pre(gs, ls, E17, a), rvownerok(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp, gstepf(gs, ls, E17, a).rvowns), rvownerok(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp, gstepf(gs, ls, E17, a).rvowns), unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).ps), gstepf(gs, ls, E17, a).phead ∈ gstepf(gs, ls, E17, a).orl, ¬ dups(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl), gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ≠ null ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E17, a).rvowns (gstepf(gs, ls, E17, a).vretRefs(gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid, gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].val), gstepf(gs, ls, E17, a).orl.last = gstepf(gs, ls, E17, a).vhead ∧ (gstepf(gs, ls, E17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E17, a).qrl.tail, gstepf(gs, ls, E17, a).vs)) ∨ gstepf(gs, ls, E17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E17, a).orl.butlast.last = gstepf(gs, ls, E17, a).vhead ∧ gstepf(gs, ls, E17, a).phead ≠ gstepf(gs, ls, E17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs), gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last ∨ gstepf(gs, ls, E17, a).qrl ≠ [] ∧ gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl.butlast).last ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E17, a).vs[(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs0

Proof step 884 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 885 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, E17, a).vrvHp = dom gstepf(gs, ls, E17, a).prvHp, gs0 = gstepf(gs, ls, E17, a), ls0 = lstepf(gs, ls, E17, a), pc0 = ready, gstepf(gs, ls, E17, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, E17), allocrv(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp), allocrv(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp), listp(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).ps, gstepf(gs, ls, E17, a).owns), markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).vs), markedp(gstepf(gs, ls, E17, a).orl, gstepf(gs, ls, E17, a).ps), nextnottid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs), noid(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vhead, gstepf(gs, ls, E17, a).vs), nonullRetRefs (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs, gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).pretRefs), noowns(lstepf(gs, ls, E17, a).tid, gstepf(gs, ls, E17, a).owns), pre(gs, ls, E17, a), rvownerok(gstepf(gs, ls, E17, a).pretRefs, gstepf(gs, ls, E17, a).prvHp, gstepf(gs, ls, E17, a).rvowns), rvownerok(gstepf(gs, ls, E17, a).vretRefs, gstepf(gs, ls, E17, a).vrvHp, gstepf(gs, ls, E17, a).rvowns), unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).ps), gstepf(gs, ls, E17, a).phead ∈ gstepf(gs, ls, E17, a).orl, ¬ dups(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl), gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next ≠ null ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E17, a).rvowns (gstepf(gs, ls, E17, a).vretRefs(gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].deqID.tid, gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).vhead].next].val), gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last ∨ gstepf(gs, ls, E17, a).qrl ≠ [] ∧ gstepf(gs, ls, E17, a).vtail = (gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl.butlast).last ∧ gstepf(gs, ls, E17, a).vs[gstepf(gs, ls, E17, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E17, a).vs[(gstepf(gs, ls, E17, a).orl + gstepf(gs, ls, E17, a).qrl).last].next = null, gstepf(gs, ls, E17, a).orl.last = gstepf(gs, ls, E17, a).vhead ∧ (gstepf(gs, ls, E17, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E17, a).qrl.tail, gstepf(gs, ls, E17, a).vs)) ∨ gstepf(gs, ls, E17, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E17, a).orl.butlast.last = gstepf(gs, ls, E17, a).vhead ∧ gstepf(gs, ls, E17, a).phead ≠ gstepf(gs, ls, E17, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E17, a).qrl, gstepf(gs, ls, E17, a).vs) ⊦ ( listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ pre(gs, ls, E17, a) ↔ a = retENQ(ls.tid); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ D3 ≠ ready; (s) ⊦ D4 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ E12 ≠ ready; (s) ⊦ D5 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D7 ≠ ready; (s) ⊦ D16 ≠ ready; (s) ⊦ D17 ≠ ready; (s) ⊦ D25 ≠ ready; (s) ⊦ D26 ≠ ready; (s) ⊦ D31 ≠ ready; (s) ⊦ D32 ≠ ready; (s) ⊦ D33 ≠ ready; (s) ⊦ D27 ≠ ready; (s) ⊦ D28 ≠ ready; (s) ⊦ D29 ≠ ready; (s) ⊦ D30 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D8 ≠ ready; (s) ⊦ D9 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D18 ≠ ready; (s) ⊦ D19 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ crashed ≠ ready; (s) ⊦ idle ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ E4 ≠ ready; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ gstepf(gs, ls, E17, retENQ(ls.tid)) = gs; (s) ⊦ lstepf(gs, ls, E17, retENQ(ls.tid)) = ls; (s) Used terms: gs0, ls0, pc0

Proof step 886 from proof copied-step-DMSQLInv (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 887 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = idle, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 888 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, idle, a), ls0 = lstepf(gs, ls, idle, a), pc0 = pcstepf(gs, ls, idle, a), DMSQGInv(gs), DMSQLInv(gs, ls, idle), pre(gs, ls, idle, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pre-idle, seq: ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 889 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid)

A spec-lemma

Proof step 890 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = callRUN(ls.tid), gs0 = gstepf(gs, ls, idle, a), ls0 = lstepf(gs, ls, idle, a), pc0 = pcstepf(gs, ls, idle, a), DMSQGInv(gs), DMSQLInv(gs, ls, idle) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 891 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, idle, callRUN(ls.tid)), ls0 = lstepf(gs, ls, idle, callRUN(ls.tid)), pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:gstepf-idle-RUN, seq: ⊦ gstepf(gs, ls, idle, callRUN(ls.tid)) = gs, subst:[gs, ls] → [gs, ls], <all paths>

Additional information

Used terms: gs, ls

Proof step 892 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ gstepf(gs, ls, idle, callRUN(ls.tid)) = gs

A spec-lemma

Proof step 893 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gs, ls0 = lstepf(gs, ls, idle, callRUN(ls.tid)), pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 894 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls0 = lstepf(gs, ls, idle, callRUN(ls.tid)), pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle) ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:lstepf-idle-RUN, seq: ⊦ lstepf(gs, ls, idle, callRUN(ls.tid)) = ls, subst:[gs, ls] → [gs, ls], <all paths>

Additional information

Used terms: gs, ls

Proof step 895 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ lstepf(gs, ls, idle, callRUN(ls.tid)) = ls

A spec-lemma

Proof step 896 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle) ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 897 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle), ¬ DMSQLInv(gs, ls0, pc0) ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-idle-ready, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, idle, a) ∧ pcstepf(gs, ls, idle, a) = ready → ( listp (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs, gstepf(gs, ls, idle, a).ps, gstepf(gs, ls, idle, a).owns) ∧ ¬ dups(gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl) ∧ markedp(gstepf(gs, ls, idle, a).orl, gstepf(gs, ls, idle, a).ps) ∧ markedp(gstepf(gs, ls, idle, a).orl, gstepf(gs, ls, idle, a).vs) ∧ unmarkedp(gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).ps) ∧ gstepf(gs, ls, idle, a).orl ≠ [] ∧ gstepf(gs, ls, idle, a).phead ∈ gstepf(gs, ls, idle, a).orl ∧ rvownerok (gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).vrvHp, gstepf(gs, ls, idle, a).rvowns) ∧ allocrv (gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs, gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, idle, a).pretRefs, gstepf(gs, ls, idle, a).prvHp, gstepf(gs, ls, idle, a).rvowns) ∧ allocrv (gstepf(gs, ls, idle, a).pretRefs, gstepf(gs, ls, idle, a).prvHp) ∧ dom gstepf(gs, ls, idle, a).vrvHp = dom gstepf(gs, ls, idle, a).prvHp ∧ ( gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead] .next ≠ null ∧ gstepf(gs, ls, idle, a).vs [gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, idle, a).rvowns (gstepf(gs, ls, idle, a).vretRefs (gstepf(gs, ls, idle, a).vs [gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, idle, a).vs [gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead] .next ] .deqID .tid, gstepf(gs, ls, idle, a).vs [gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead] .next ] .val)) ∧ ( gstepf(gs, ls, idle, a).orl.last = gstepf(gs, ls, idle, a).vhead ∧ ( gstepf(gs, ls, idle, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, idle, a).qrl.tail, gstepf(gs, ls, idle, a).vs)) ∨ gstepf(gs, ls, idle, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, idle, a).orl.butlast.last = gstepf(gs, ls, idle, a).vhead ∧ gstepf(gs, ls, idle, a).phead ≠ gstepf(gs, ls, idle, a).orl.last ∧ unmarkedp (gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs)) ∧ ( gstepf(gs, ls, idle, a).vtail = (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl ).last ∨ gstepf(gs, ls, idle, a).qrl ≠ [] ∧ gstepf(gs, ls, idle, a).vtail = ( gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl.butlast ).last ∧ gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).qrl.last] .deqID = None ∧ gstepf(gs, ls, idle, a).vs [(gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).vhead, gstepf(gs, ls, idle, a).vs) ∧ noid (lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vhead, gstepf(gs, ls, idle, a).vs) ∧ noowns(lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).owns), subst:[gs, ls, a] → [gs, ls, callRUN(ls.tid)]

Additional information

Used terms: gs, ls, callRUN(ls.tid)

Proof step 898 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, idle, a) ∧ pcstepf(gs, ls, idle, a) = ready → ( listp (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs, gstepf(gs, ls, idle, a).ps, gstepf(gs, ls, idle, a).owns) ∧ ¬ dups(gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl) ∧ markedp(gstepf(gs, ls, idle, a).orl, gstepf(gs, ls, idle, a).ps) ∧ markedp(gstepf(gs, ls, idle, a).orl, gstepf(gs, ls, idle, a).vs) ∧ unmarkedp(gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).ps) ∧ gstepf(gs, ls, idle, a).orl ≠ [] ∧ gstepf(gs, ls, idle, a).phead ∈ gstepf(gs, ls, idle, a).orl ∧ rvownerok(gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).vrvHp, gstepf(gs, ls, idle, a).rvowns) ∧ allocrv(gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs, gstepf(gs, ls, idle, a).vretRefs, gstepf(gs, ls, idle, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, idle, a).pretRefs, gstepf(gs, ls, idle, a).prvHp, gstepf(gs, ls, idle, a).rvowns) ∧ allocrv(gstepf(gs, ls, idle, a).pretRefs, gstepf(gs, ls, idle, a).prvHp) ∧ dom gstepf(gs, ls, idle, a).vrvHp = dom gstepf(gs, ls, idle, a).prvHp ∧ ( gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead].next ≠ null ∧ gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead].next].deqID ≠ None → gstepf(gs, ls, idle, a).rvowns (gstepf(gs, ls, idle, a).vretRefs(gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead].next].deqID.tid, gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).vhead].next].val)) ∧ ( gstepf(gs, ls, idle, a).orl.last = gstepf(gs, ls, idle, a).vhead ∧ (gstepf(gs, ls, idle, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, idle, a).qrl.tail, gstepf(gs, ls, idle, a).vs)) ∨ gstepf(gs, ls, idle, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, idle, a).orl.butlast.last = gstepf(gs, ls, idle, a).vhead ∧ gstepf(gs, ls, idle, a).phead ≠ gstepf(gs, ls, idle, a).orl.last ∧ unmarkedp(gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vs)) ∧ ( gstepf(gs, ls, idle, a).vtail = (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl).last ∨ gstepf(gs, ls, idle, a).qrl ≠ [] ∧ gstepf(gs, ls, idle, a).vtail = (gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl.butlast).last ∧ gstepf(gs, ls, idle, a).vs[gstepf(gs, ls, idle, a).qrl.last].deqID = None ∧ gstepf(gs, ls, idle, a).vs[(gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).vhead, gstepf(gs, ls, idle, a).vs) ∧ noid (lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).orl + gstepf(gs, ls, idle, a).qrl, gstepf(gs, ls, idle, a).vhead, gstepf(gs, ls, idle, a).vs) ∧ noowns(lstepf(gs, ls, idle, a).tid, gstepf(gs, ls, idle, a).owns)

Lemma step-idle-ready

Proof step 899 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle), ¬ DMSQLInv(gs, ls0, pc0), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, idle, callRUN(ls.tid)) ∧ pcstepf(gs, ls, idle, callRUN(ls.tid)) = ready → ( listp (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs, gstepf(gs, ls, idle, callRUN(ls.tid)).ps, gstepf(gs, ls, idle, callRUN(ls.tid)).owns) ∧ ¬ dups(gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl) ∧ markedp(gstepf(gs, ls, idle, callRUN(ls.tid)).orl, gstepf(gs, ls, idle, callRUN(ls.tid)).ps) ∧ markedp(gstepf(gs, ls, idle, callRUN(ls.tid)).orl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs) ∧ unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).ps) ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).orl ≠ [] ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).phead ∈ gstepf(gs, ls, idle, callRUN(ls.tid)).orl ∧ rvownerok (gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp, gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns) ∧ allocrv(gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs, gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs) ∧ rvownerok (gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp, gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns) ∧ allocrv(gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp) ∧ dom gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp = dom gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp ∧ ( gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next ≠ null ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next] .deqID ≠ None → gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns (gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs (gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next] .deqID .tid)) = Claimed (gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next] .deqID .tid, gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next].val)) ∧ ( gstepf(gs, ls, idle, callRUN(ls.tid)).orl.last = gstepf(gs, ls, idle, callRUN(ls.tid)).vhead ∧ ( gstepf(gs, ls, idle, callRUN(ls.tid)).qrl ≠ [] → unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.tail, gstepf(gs, ls, idle, callRUN(ls.tid)).vs)) ∨ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.butlast ≠ [] ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.butlast.last = gstepf(gs, ls, idle, callRUN(ls.tid)).vhead ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).phead ≠ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.last ∧ unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs)) ∧ ( gstepf(gs, ls, idle, callRUN(ls.tid)).vtail = (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl).last ∨ gstepf(gs, ls, idle, callRUN(ls.tid)).qrl ≠ [] ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vtail = (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.butlast).last ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.last].deqID = None ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[(gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl).last] .next = null)) ∧ nextnottid(lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).vhead, gstepf(gs, ls, idle, callRUN(ls.tid)).vs) ∧ noid (lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vhead, gstepf(gs, ls, idle, callRUN(ls.tid)).vs) ∧ noowns(lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).owns) ⊦

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 900 from proof copied-step-DMSQLInv (previous step) (back to tree)

ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), DMSQGInv(gs), DMSQLInv(gs, ls, idle), ¬ DMSQLInv(gs, ls0, pc0) ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, idle, callRUN(ls.tid)) ∧ pcstepf(gs, ls, idle, callRUN(ls.tid)) = ready

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 901 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 902 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gs.vrvHp = dom gs.prvHp, ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), gs.orl ≠ [], DMSQLInv(gs, ls, idle), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ DMSQLInv(gs, ls0, pc0), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, idle, callRUN(ls.tid)) ∧ pcstepf(gs, ls, idle, callRUN(ls.tid)) = ready

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] → [gs, ls, idle], <all paths>

Additional information

Used simplifier rules: ⊦ crashed ≠ idle; (s) ⊦ D7 ≠ idle; (s) ⊦ D32 ≠ idle; (s) ⊦ D33 ≠ idle; (s) ⊦ E4 ≠ idle; (s) ⊦ E16 ≠ idle; (s) ⊦ E15 ≠ idle; (s) ⊦ E14 ≠ idle; (s) ⊦ E13 ≠ idle; (s) ⊦ E12 ≠ idle; (s) ⊦ E11 ≠ idle; (s) ⊦ E10 ≠ idle; (s) ⊦ E9 ≠ idle; (s) ⊦ E8 ≠ idle; (s) ⊦ E7 ≠ idle; (s) ⊦ E6 ≠ idle; (s) ⊦ E5 ≠ idle; (s) ⊦ E3 ≠ idle; (s) ⊦ E2 ≠ idle; (s) ⊦ D34 ≠ idle; (s) ⊦ D31 ≠ idle; (s) ⊦ D30 ≠ idle; (s) ⊦ D29 ≠ idle; (s) ⊦ D28 ≠ idle; (s) ⊦ D27 ≠ idle; (s) ⊦ D26 ≠ idle; (s) ⊦ D25 ≠ idle; (s) ⊦ D24 ≠ idle; (s) ⊦ D23 ≠ idle; (s) ⊦ D22 ≠ idle; (s) ⊦ D21 ≠ idle; (s) ⊦ D20 ≠ idle; (s) ⊦ D19 ≠ idle; (s) ⊦ D18 ≠ idle; (s) ⊦ D17 ≠ idle; (s) ⊦ D16 ≠ idle; (s) ⊦ D15 ≠ idle; (s) ⊦ D14 ≠ idle; (s) ⊦ D13 ≠ idle; (s) ⊦ D12 ≠ idle; (s) ⊦ D11 ≠ idle; (s) ⊦ D10 ≠ idle; (s) ⊦ D9 ≠ idle; (s) ⊦ D8 ≠ idle; (s) ⊦ D6 ≠ idle; (s) ⊦ D5 ≠ idle; (s) ⊦ D4 ≠ idle; (s) ⊦ D3 ≠ idle; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, idle, a) ↔ a = callRUN(ls.tid); (s) ⊦ pcstepf(gs, ls, idle, callRUN(ls.tid)) = ready; (s) Used terms: gs, ls, idle

Proof step 903 from proof copied-step-DMSQLInv (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 904 from proof copied-step-DMSQLInv (previous step) (back to tree)

dom gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp = dom gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp, ls0 = ls, pc0 = pcstepf(gs, ls, idle, callRUN(ls.tid)), gstepf(gs, ls, idle, callRUN(ls.tid)).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, idle), allocrv(gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp), allocrv(gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp), listp (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs, gstepf(gs, ls, idle, callRUN(ls.tid)).ps, gstepf(gs, ls, idle, callRUN(ls.tid)).owns), markedp(gstepf(gs, ls, idle, callRUN(ls.tid)).orl, gstepf(gs, ls, idle, callRUN(ls.tid)).ps), markedp(gstepf(gs, ls, idle, callRUN(ls.tid)).orl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs), nextnottid(lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).vhead, gstepf(gs, ls, idle, callRUN(ls.tid)).vs), noid (lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vhead, gstepf(gs, ls, idle, callRUN(ls.tid)).vs), nonullRetRefs (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs, gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs), noowns(lstepf(gs, ls, idle, callRUN(ls.tid)).tid, gstepf(gs, ls, idle, callRUN(ls.tid)).owns), rvownerok(gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).vrvHp, gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns), rvownerok(gstepf(gs, ls, idle, callRUN(ls.tid)).pretRefs, gstepf(gs, ls, idle, callRUN(ls.tid)).prvHp, gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns), unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).ps), gstepf(gs, ls, idle, callRUN(ls.tid)).phead ∈ gstepf(gs, ls, idle, callRUN(ls.tid)).orl, ¬ DMSQLInv(gs, ls0, pc0), ¬ dups(gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl), gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next ≠ null ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next].deqID ≠ None → gstepf(gs, ls, idle, callRUN(ls.tid)).rvowns (gstepf(gs, ls, idle, callRUN(ls.tid)).vretRefs (gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next].deqID.tid, gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).vhead].next].val), gstepf(gs, ls, idle, callRUN(ls.tid)).orl.last = gstepf(gs, ls, idle, callRUN(ls.tid)).vhead ∧ ( gstepf(gs, ls, idle, callRUN(ls.tid)).qrl ≠ [] → unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.tail, gstepf(gs, ls, idle, callRUN(ls.tid)).vs)) ∨ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.butlast ≠ [] ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.butlast.last = gstepf(gs, ls, idle, callRUN(ls.tid)).vhead ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).phead ≠ gstepf(gs, ls, idle, callRUN(ls.tid)).orl.last ∧ unmarkedp(gstepf(gs, ls, idle, callRUN(ls.tid)).qrl, gstepf(gs, ls, idle, callRUN(ls.tid)).vs), gstepf(gs, ls, idle, callRUN(ls.tid)).vtail = (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl).last ∨ gstepf(gs, ls, idle, callRUN(ls.tid)).qrl ≠ [] ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vtail = (gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.butlast).last ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[gstepf(gs, ls, idle, callRUN(ls.tid)).qrl.last].deqID = None ∧ gstepf(gs, ls, idle, callRUN(ls.tid)).vs[(gstepf(gs, ls, idle, callRUN(ls.tid)).orl + gstepf(gs, ls, idle, callRUN(ls.tid)).qrl).last].next = null ⊦

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] → [gs, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ lstepf(gs, ls, idle, callRUN(ls.tid)) = ls; (s) ⊦ gstepf(gs, ls, idle, callRUN(ls.tid)) = gs; (s) ⊦ crashed ≠ ready; (s) ⊦ idle ≠ ready; (s) ⊦ D1 ≠ ready; (s) ⊦ D2 ≠ ready; (s) ⊦ D3 ≠ ready; (s) ⊦ D4 ≠ ready; (s) ⊦ D5 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D7 ≠ ready; (s) ⊦ D8 ≠ ready; (s) ⊦ D9 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D16 ≠ ready; (s) ⊦ D17 ≠ ready; (s) ⊦ D18 ≠ ready; (s) ⊦ D19 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ D25 ≠ ready; (s) ⊦ D26 ≠ ready; (s) ⊦ D27 ≠ ready; (s) ⊦ D28 ≠ ready; (s) ⊦ D29 ≠ ready; (s) ⊦ D30 ≠ ready; (s) ⊦ D31 ≠ ready; (s) ⊦ D32 ≠ ready; (s) ⊦ D33 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ E1 ≠ ready; (s) ⊦ E12 ≠ ready; (s) ⊦ E17 ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ pcstepf(gs, ls, idle, callRUN(ls.tid)) = ready; (s) ⊦ E4 ≠ ready; (s) Used terms: gs, ls0, pc0

Proof step 905 from proof copied-step-DMSQLInv (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 906 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, pc, a), ls0 = lstepf(gs, ls, pc, a), pc = ready, pc0 = pcstepf(gs, ls, pc, a), DMSQGInv(gs), DMSQLInv(gs, ls, pc), pre(gs, ls, pc, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 3, flags: discard

Additional information

Proof step 907 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready), pre(gs, ls, ready, a) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:pre-ready, seq:⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid), subst:[gs, ls, a] → [gs, ls, a], <all paths>

Additional information

Used terms: gs, ls, a

Proof step 908 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid)

A spec-lemma

Proof step 909 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready), (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 910 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready), ∃ value0. a = invENQ(ls.tid, value0) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule exists left

And obtained the following new goals

Rule argument

pos: left 6

Additional information

Proof step 911 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invENQ(ls.tid, value0), gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule subst equation

And obtained the following new goals

Rule argument

pos: left 1, flags: discard

Additional information

Proof step 912 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gstepf(gs, ls, ready, invENQ(ls.tid, value0)), ls0 = lstepf(gs, ls, ready, invENQ(ls.tid, value0)), pc0 = pcstepf(gs, ls, ready, invENQ(ls.tid, value0)), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:gstepf-ready, seq: ⊦ gstepf(gs, ls, ready, a) = gs, subst:[gs, ls, a] → [gs, ls, invENQ(ls.tid, value0)], <all paths>

Additional information

Used terms: gs, ls, invENQ(ls.tid, value0)

Proof step 913 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ gstepf(gs, ls, ready, a) = gs

A spec-lemma

Proof step 914 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gs, ls0 = lstepf(gs, ls, ready, invENQ(ls.tid, value0)), pc0 = pcstepf(gs, ls, ready, invENQ(ls.tid, value0)), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:lstepf-ready-ENQ, seq: ⊦ lstepf(gs, ls, ready, invENQ(ls.tid, value0)) = ls.value:= value0, subst:[gs, ls, value0] → [gs, ls, value0], <all paths>

Additional information

Used terms: gs, ls, value0

Proof step 915 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ lstepf(gs, ls, ready, invENQ(ls.tid, value0)) = ls.value:= value0

A spec-lemma

Proof step 916 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gs, ls0 = ls.value:= value0, pc0 = pcstepf(gs, ls, ready, invENQ(ls.tid, value0)), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ (ls.value:= value).tid = ls.tid; (s)

Proof step 917 from proof copied-step-DMSQLInv (previous step) (back to tree)

gs0 = gs, ls0 = ls.value:= value0, pc0 = pcstepf(gs, ls, ready, invENQ(ls.tid, value0)), DMSQGInv(gs), DMSQLInv(gs, ls, ready), ¬ DMSQLInv(gs0, ls0, pc0) ⊦

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] → [gs, ls, ready], <all paths>

Additional information

Used terms: gs, ls, ready

Proof step 918 from proof copied-step-DMSQLInv (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 919 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

User applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ D3 ≠ ready; (s) ⊦ D4 ≠ ready; (s) ⊦ D5 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D8 ≠ ready; (s) ⊦ D9 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D16 ≠ ready; (s) ⊦ D17 ≠ ready; (s) ⊦ D18 ≠ ready; (s) ⊦ D19 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ D25 ≠ ready; (s) ⊦ D26 ≠ ready; (s) ⊦ D27 ≠ ready; (s) ⊦ D28 ≠ ready; (s) ⊦ D29 ≠ ready; (s) ⊦ D30 ≠ ready; (s) ⊦ D31 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ E12 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ E4 ≠ ready; (s) ⊦ D33 ≠ ready; (s) ⊦ D32 ≠ ready; (s) ⊦ D7 ≠ ready; (s) ⊦ idle ≠ ready; (s) ⊦ crashed ≠ ready; (s) ⊦ pcstepf(gs, ls, ready, invENQ(ls.tid, value0)) = E1; (s)

Proof step 920 from proof copied-step-DMSQLInv (previous step) (back to tree)

DMSQGInv(gs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noowns(ls.tid, gs.owns), ¬ DMSQLInv(gs, ls.value:= value0, E1) ⊦

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] → [gs, ls.value:= value0, E1], <all paths>

Additional information

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

Proof step 921 from proof copied-step-DMSQLInv (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 922 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: <toplevel>, name:step-ready-D1, seq:⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns (gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed (gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1 → ( listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns) ∧ ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs) ∧ unmarkedp (gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps) ∧ gstepf(gs, ls, ready, a).orl ≠ [] ∧ gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl ∧ rvownerok (gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv (gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs) ∧ rvownerok (gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv (gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp) ∧ dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp ∧ ( gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead] .next ≠ null ∧ gstepf(gs, ls, ready, a).vs [gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead] .next ] .deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs (gstepf(gs, ls, ready, a).vs [gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead] .next ] .deqID .tid)) = Claimed (gstepf(gs, ls, ready, a).vs [gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead] .next ] .deqID .tid, gstepf(gs, ls, ready, a).vs [gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead] .next ] .val)) ∧ ( gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ ( gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp (gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp (gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs)) ∧ ( gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl ).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = ( gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast ).last ∧ gstepf(gs, ls, ready, a).vs [gstepf(gs, ls, ready, a).qrl.last ] .deqID = None ∧ gstepf(gs, ls, ready, a).vs [( gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl ).last ] .next = null)) ∧ nextnottid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns), subst:[gs, ls, a] → [gs, ls, a]

Additional information

Used terms: gs, ls, a

Proof step 923 from proof copied-step-DMSQLInv (previous step) (back to tree)

⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1 → ( listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns) ∧ ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs) ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps) ∧ gstepf(gs, ls, ready, a).orl ≠ [] ∧ gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl ∧ rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp) ∧ dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp ∧ ( gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val)) ∧ ( gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs)) ∧ ( gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns)

Lemma step-ready-D1

Proof step 924 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready), ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1 → ( listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns) ∧ ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps) ∧ markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs) ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps) ∧ gstepf(gs, ls, ready, a).orl ≠ [] ∧ gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl ∧ rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns) ∧ allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp) ∧ dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp ∧ ( gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val)) ∧ ( gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs)) ∧ ( gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null)) ∧ nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs) ∧ noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 7

Additional information

Proof step 925 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), DMSQGInv(gs), DMSQLInv(gs, ls, ready) ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid, ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: gs

Proof step 926 from proof copied-step-DMSQLInv (previous step) (back to tree)

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

A spec-lemma

Proof step 927 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), dom gs.vrvHp = dom gs.prvHp, gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), gs.orl ≠ [], DMSQLInv(gs, ls, ready), allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = D1, DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

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] → [gs, ls, ready], <all paths>

Additional information

Used simplifier rules: ⊦ crashed ≠ ready; (s) ⊦ idle ≠ ready; (s) ⊦ D7 ≠ ready; (s) ⊦ D32 ≠ ready; (s) ⊦ D33 ≠ ready; (s) ⊦ E4 ≠ ready; (s) ⊦ E16 ≠ ready; (s) ⊦ E15 ≠ ready; (s) ⊦ E14 ≠ ready; (s) ⊦ E13 ≠ ready; (s) ⊦ E12 ≠ ready; (s) ⊦ E11 ≠ ready; (s) ⊦ E10 ≠ ready; (s) ⊦ E9 ≠ ready; (s) ⊦ E8 ≠ ready; (s) ⊦ E7 ≠ ready; (s) ⊦ E6 ≠ ready; (s) ⊦ E5 ≠ ready; (s) ⊦ E3 ≠ ready; (s) ⊦ E2 ≠ ready; (s) ⊦ D34 ≠ ready; (s) ⊦ D31 ≠ ready; (s) ⊦ D30 ≠ ready; (s) ⊦ D29 ≠ ready; (s) ⊦ D28 ≠ ready; (s) ⊦ D27 ≠ ready; (s) ⊦ D26 ≠ ready; (s) ⊦ D25 ≠ ready; (s) ⊦ D24 ≠ ready; (s) ⊦ D23 ≠ ready; (s) ⊦ D22 ≠ ready; (s) ⊦ D21 ≠ ready; (s) ⊦ D20 ≠ ready; (s) ⊦ D19 ≠ ready; (s) ⊦ D18 ≠ ready; (s) ⊦ D17 ≠ ready; (s) ⊦ D16 ≠ ready; (s) ⊦ D15 ≠ ready; (s) ⊦ D14 ≠ ready; (s) ⊦ D13 ≠ ready; (s) ⊦ D12 ≠ ready; (s) ⊦ D11 ≠ ready; (s) ⊦ D10 ≠ ready; (s) ⊦ D9 ≠ ready; (s) ⊦ D8 ≠ ready; (s) ⊦ D6 ≠ ready; (s) ⊦ D5 ≠ ready; (s) ⊦ D4 ≠ ready; (s) ⊦ D3 ≠ ready; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ pre(gs, ls, ready, a) ↔ (∃ value0. a = invENQ(ls.tid, value0)) ∨ a = invDEQ(ls.tid); (s) ⊦ invDEQ(tid) ≠ invENQ(tid0, invENQvalue); (s) ⊦ pcstepf(gs, ls, ready, invDEQ(ls.tid)) = D1; (s) Used terms: gs, ls, ready

Proof step 928 from proof copied-step-DMSQLInv (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 929 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp, gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), gstepf(gs, ls, ready, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, ready), allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp), allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp), listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns), markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps), markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs), nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs), noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs), nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs), noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns), rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns), rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns), unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps), gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl, ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl), gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs(gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val), gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs), gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null ⊦ DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ lstepf(gs, ls, ready, invDEQ(ls.tid)) = ls; (s)

Proof step 930 from proof copied-step-DMSQLInv (previous step) (back to tree)

a = invDEQ(ls.tid), dom gstepf(gs, ls, ready, a).vrvHp = dom gstepf(gs, ls, ready, a).prvHp, gs0 = gstepf(gs, ls, ready, a), ls0 = lstepf(gs, ls, ready, a), pc0 = pcstepf(gs, ls, ready, a), gstepf(gs, ls, ready, a).orl ≠ [], DMSQGInv(gs), DMSQLInv(gs, ls, ready), allocrv(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp), allocrv(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp), listp (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).ps, gstepf(gs, ls, ready, a).owns), markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).vs), markedp(gstepf(gs, ls, ready, a).orl, gstepf(gs, ls, ready, a).ps), nextnottid(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs), noid (lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vhead, gstepf(gs, ls, ready, a).vs), nonullRetRefs (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs, gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).pretRefs), noowns(lstepf(gs, ls, ready, a).tid, gstepf(gs, ls, ready, a).owns), rvownerok(gstepf(gs, ls, ready, a).pretRefs, gstepf(gs, ls, ready, a).prvHp, gstepf(gs, ls, ready, a).rvowns), rvownerok(gstepf(gs, ls, ready, a).vretRefs, gstepf(gs, ls, ready, a).vrvHp, gstepf(gs, ls, ready, a).rvowns), unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).ps), gstepf(gs, ls, ready, a).phead ∈ gstepf(gs, ls, ready, a).orl, ¬ DMSQLInv(gs0, ls0, pc0), ¬ dups(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl), gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next ≠ null ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID ≠ None → gstepf(gs, ls, ready, a).rvowns (gstepf(gs, ls, ready, a).vretRefs(gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].deqID.tid, gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).vhead].next].val), gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last ∨ gstepf(gs, ls, ready, a).qrl ≠ [] ∧ gstepf(gs, ls, ready, a).vtail = (gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl.butlast).last ∧ gstepf(gs, ls, ready, a).vs[gstepf(gs, ls, ready, a).qrl.last].deqID = None ∧ gstepf(gs, ls, ready, a).vs[(gstepf(gs, ls, ready, a).orl + gstepf(gs, ls, ready, a).qrl).last].next = null, gstepf(gs, ls, ready, a).orl.last = gstepf(gs, ls, ready, a).vhead ∧ (gstepf(gs, ls, ready, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, ready, a).qrl.tail, gstepf(gs, ls, ready, a).vs)) ∨ gstepf(gs, ls, ready, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, ready, a).orl.butlast.last = gstepf(gs, ls, ready, a).vhead ∧ gstepf(gs, ls, ready, a).phead ≠ gstepf(gs, ls, ready, a).orl.last ∧ unmarkedp(gstepf(gs, ls, ready, a).qrl, gstepf(gs, ls, ready, a).vs) ⊦

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] → [gs0, ls0, pc0], <all paths>

Additional information

Used simplifier rules: ⊦ D1 ≠ D3; (s) ⊦ D1 ≠ D4; (s) ⊦ D1 ≠ D34; (s) ⊦ D1 ≠ D5; (s) ⊦ D1 ≠ D6; (s) ⊦ D1 ≠ D7; (s) ⊦ D1 ≠ D16; (s) ⊦ D1 ≠ D17; (s) ⊦ D1 ≠ D25; (s) ⊦ D1 ≠ D26; (s) ⊦ D1 ≠ D31; (s) ⊦ D1 ≠ D32; (s) ⊦ D1 ≠ D33; (s) ⊦ D1 ≠ D27; (s) ⊦ D1 ≠ D28; (s) ⊦ D1 ≠ D29; (s) ⊦ D1 ≠ D30; (s) ⊦ D1 ≠ D20; (s) ⊦ D1 ≠ D21; (s) ⊦ D1 ≠ E1; (s) ⊦ D1 ≠ E12; (s) ⊦ D1 ≠ E17; (s) ⊦ D1 ≠ D8; (s) ⊦ D1 ≠ D9; (s) ⊦ D1 ≠ D10; (s) ⊦ D1 ≠ D11; (s) ⊦ D1 ≠ D12; (s) ⊦ D1 ≠ D13; (s) ⊦ D1 ≠ D14; (s) ⊦ D1 ≠ D15; (s) ⊦ D1 ≠ D18; (s) ⊦ D1 ≠ D19; (s) ⊦ D1 ≠ D22; (s) ⊦ D1 ≠ D23; (s) ⊦ D1 ≠ D24; (s) ⊦ D1 ≠ crashed; (s) ⊦ D1 ≠ idle; (s) ⊦ D1 ≠ ready; (s) ⊦ lstepf(gs, ls, ready, invDEQ(ls.tid)) = ls; (s) ⊦ gstepf(gs, ls, ready, a) = gs; (s) ⊦ D1 ≠ E2; (s) ⊦ D1 ≠ E3; (s) ⊦ D1 ≠ E5; (s) ⊦ D1 ≠ E6; (s) ⊦ D1 ≠ E7; (s) ⊦ D1 ≠ E8; (s) ⊦ D1 ≠ E9; (s) ⊦ D1 ≠ E13; (s) ⊦ D1 ≠ E14; (s) ⊦ D1 ≠ E15; (s) ⊦ D1 ≠ E16; (s) ⊦ D1 ≠ E10; (s) ⊦ D1 ≠ E11; (s) ⊦ pcstepf(gs, ls, ready, invDEQ(ls.tid)) = D1; (s) ⊦ D1 ≠ E4; (s) Used terms: gs0, ls0, pc0

Proof step 931 from proof copied-step-DMSQLInv (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 Tree for copied-step-DMSQLInv (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