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

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,

Theorem base for Specification DMSQ-proofs

This is a listing of all goals defined over the current specification. Axioms are marked yellow, proved theorems green and unproved theorems blue. Click on individual names to get more information on the proof.

Name: Sequent: Type:
step-D16-D17⊦ ( (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) A Proof Obligation
stable-D21⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.nxt ≠ null ∧ ls.first ∈ gs0.orl ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-E14⊦ ( (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) → (ls.lst ∈ gs.ps ∧ ls.lst ∈ gs.vs) ∧ (gs.orl + gs.qrl ≠ [] ∧ (ls.lst = (gs.orl + gs.qrl).last ⊃ ls.lst ∈ gs.vs;true)) ∧ gs.orl + gs.qrl ≠ [] ∧ (ls.lst = (gs.orl + gs.qrl).last ⊃ ls.lst ∈ gs.vs;true) A Proof Obligation
step-D10-D33⊦ ( ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (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) A Proof Obligation
Crash-TheoremDMSQGInv(gs), pcf = pcf0, lsf = lsf0, gs = gs0 ⊦ ⟪ps := gs.ps, vs := gs.vs, phead := gs.phead, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, pretRefs := gs.pretRefs, vrvHp := gs.vrvHp, prvHp := gs.prvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( DMSQGInv(gs) ∧ gs.ps = gs0.ps ∧ gs.vs = gs0.ps ∧ gs.phead = gs0.phead ∧ gs.vretRefs = gs0.pretRefs ∧ gs.vrvHp = gs0.prvHp ∧ gs.qrl = gs0.qrl ∧ gs.orl = gs0.orl ∧ gs.owns = (λ r. None) ∧ (gs.vs[gs.vhead].next ≠ null → gs.vs[gs.vs[gs.vhead].next].deqID = None) ∧ gs.vhead = gs.orl.last ∧ gs.vtail = (gs.orl + gs.qrl).last ∧ (∀ tid. pcf(tid) = (pcf0(tid) = idle ⊃ idle;crashed) ∧ lsf(tid).tid = lsf0(tid).tid)) A User Theorem
rely-DMSQLInv ⊦ ls.tid ≠ tid0 ∧ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQRely(gs, tid0, gs0) An Axiom
rely-D3-D4⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D3, a).orl) ∧ gstepf(gs, ls, D3, a).vtail ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vtail ∧ gstepf(gs, ls, D3, a).phead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.phead ∧ gstepf(gs, ls, D3, a).vhead ∈ gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D3, a).vs, gstepf(gs, ls, D3, a).ps, gstepf(gs, ls, D3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D3, a).vretRefs, gstepf(gs, ls, D3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D3, a).orl + gstepf(gs, ls, D3, a).qrl, gstepf(gs, ls, D3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D3, a).vhead, gstepf(gs, ls, D3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D3, a).owns) A Proof Obligation
stable-E2⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
DMSQInv-thm ⊦ DMSQInv(gs, lsf, pcf) ∧ DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) → DMSQInv(gs0, lsf0, pcf0) An Axiom
rely-D19-D20⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D19, a).orl) ∧ gstepf(gs, ls, D19, a).vtail ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vtail ∧ gstepf(gs, ls, D19, a).phead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.phead ∧ gstepf(gs, ls, D19, a).vhead ∈ gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D19, a).vs, gstepf(gs, ls, D19, a).ps, gstepf(gs, ls, D19, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D19, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D19, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D19, a).vretRefs, gstepf(gs, ls, D19, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D19, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D19, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D19, a).orl + gstepf(gs, ls, D19, a).qrl, gstepf(gs, ls, D19, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D19, a).vhead, gstepf(gs, ls, D19, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D19, a).owns) A Proof Obligation
DMSQGInv-noemptyorl ⊦ ¬ DMSQGInv(mkgs(ps, vs, vhead, phead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, [], owns, rowns)) A User Theorem
definedness-FLUSHNEXT⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null → (r ∈ gs.ps ∧ r ∈ gs.vs) ∧ ((gs.orl + gs.qrl ≠ [] ∧ (r = (gs.orl + gs.qrl).last → r ∈ gs.vs)) ∧ (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ r ∈ gs.vs;true)) ∧ (gs.orl + gs.qrl ≠ [] ∧ (r = (gs.orl + gs.qrl).last → r ∈ gs.vs)) ∧ (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ r ∈ gs.vs;true) A Proof Obligation
stable-D15⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.vrvHp[ls.rvref] = Empty ∧ gs0.prvHp[ls.rvref] = Empty) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-D21⊦ ( ( ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.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) → (ls.nxt ∈ gs.ps ∧ ls.nxt ∈ gs.vs) ∧ (ls.nxt ∈ gs.ps ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl ≠ [];true)) ∧ ls.nxt ∈ gs.ps ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl ≠ [];true) A Proof Obligation
step-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid An Axiom
stable-E14⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.nxt = gs0.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
definedness-D18⊦ ( (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) → ls.nxt ∈ gs.ps ⊕ gs.vs A Proof Obligation
stable-D9⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-E4-E17⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) A Proof Obligation
rely-E11-E12⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns) A Proof Obligation
stable-D18⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-D30⊦ ( ( ls.first ∈ gs.orl ∧ gs.ps[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) → ls.addr ∈ gs.vrvHp A Proof Obligation
step-E6-E7⊦ ( (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) A Proof Obligation
rely-D2-D2⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl) ∧ gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns) A Proof Obligation
definedness-D24⊦ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ 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) → (gs.vhead = ls.first ⊃ true;true) A Proof Obligation
step-E10-E13⊦ ( ( ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[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) A Proof Obligation
step-D12-D16⊦ ( (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) A Proof Obligation
init (∃ r, value. r ≠ null ∧ ps = ∅[r, mk(value, Some(dummytid), null)] ∧ phead = r ∧ vhead = r ∧ vtail = r ∧ orl = r ' ∧ qrl = [] ∧ vs = ps) ∧ vrvHp = ∅ ∧ prvHp = ∅ ∧ vretRefs = (λ tid. null) ∧ pretRefs = (λ tid. null) ∧ owns = (λ r. None) ⊦ listp(orl + qrl, vs, ps, owns) ∧ ¬ dups(orl + qrl) ∧ markedp(orl, ps) ∧ markedp(orl, vs) ∧ unmarkedp(qrl, ps) ∧ orl ≠ [] ∧ phead ∈ orl ∧ rvownerok(vretRefs, vrvHp, rvowns) ∧ allocrv(vretRefs, vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs) ∧ rvownerok(pretRefs, prvHp, rvowns) ∧ allocrv(pretRefs, prvHp) ∧ dom vrvHp = dom prvHp ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ (orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null) A User Theorem
step-E13-E4⊦ ( 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) ) A Proof Obligation
stable-D3⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.rvowns(ls.rvref) = Pending(ls.tid) ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ∈ gs0.prvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D31-D6⊦ ( (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) A Proof Obligation
rely-E12-E4⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E12, a).orl) ∧ gstepf(gs, ls, E12, a).vtail ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vtail ∧ gstepf(gs, ls, E12, a).phead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.phead ∧ gstepf(gs, ls, E12, a).vhead ∈ gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E12, a).vs, gstepf(gs, ls, E12, a).ps, gstepf(gs, ls, E12, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E12, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E12, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E12, a).vretRefs, gstepf(gs, ls, E12, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E12, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E12, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E12, a).orl + gstepf(gs, ls, E12, a).qrl, gstepf(gs, ls, E12, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E12, a).vhead, gstepf(gs, ls, E12, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E12, a).owns) A Proof Obligation
rely-D4-D5⊦ ls.tid ≠ tid0 ∧ ( ( gs.vretRefs(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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D4, a).orl) ∧ gstepf(gs, ls, D4, a).vtail ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vtail ∧ gstepf(gs, ls, D4, a).phead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.phead ∧ gstepf(gs, ls, D4, a).vhead ∈ gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D4, a).vs, gstepf(gs, ls, D4, a).ps, gstepf(gs, ls, D4, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D4, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D4, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D4, a).vretRefs, gstepf(gs, ls, D4, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D4, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D4, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D4, a).orl + gstepf(gs, ls, D4, a).qrl, gstepf(gs, ls, D4, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D4, a).vhead, gstepf(gs, ls, D4, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D4, a).owns) A Proof Obligation
definedness-E11⊦ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[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) → (ls.lst ∈ gs.ps ∧ ls.lst ∈ gs.vs) ∧ ((ls.lst ∈ gs.ps ∧ ls.lst ∈ gs.vs) ∧ (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ true;ls.lst ∈ gs.vs)) ∧ ls.lst ∈ gs.ps ∧ ls.lst ∈ gs.vs A Proof Obligation
step-E15-E4⊦ ( (gs.owns(ls.node) = Some(ls.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) ) A Proof Obligation
step-D33-D6⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) A Proof Obligation
step-D14-D15⊦ ( (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) A Proof Obligation
stable-D29⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.first ∈ gs0.orl ∧ gs0.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs0.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D6-D34⊦ ( ( (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = 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) A Proof Obligation
step-D13-D14⊦ ( (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) A Proof Obligation
step-D21-D22⊦ ( ( ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.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) A Proof Obligation
step-E7-E16⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ 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) A Proof Obligation
rely-D17-D6⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D17, a).orl) ∧ gstepf(gs, ls, D17, a).vtail ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vtail ∧ gstepf(gs, ls, D17, a).phead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.phead ∧ gstepf(gs, ls, D17, a).vhead ∈ gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D17, a).vs, gstepf(gs, ls, D17, a).ps, gstepf(gs, ls, D17, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D17, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D17, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D17, a).vretRefs, gstepf(gs, ls, D17, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D17, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D17, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D17, a).orl + gstepf(gs, ls, D17, a).qrl, gstepf(gs, ls, D17, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D17, a).vhead, gstepf(gs, ls, D17, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D17, a).owns) A Proof Obligation
stable-D6⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( (ls.success → ls.optval = gs0.vrvHp[ls.rvref] ∧ ls.optval = gs0.prvHp[ls.rvref]) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = (ls.optval = Empty ∨ ¬ ls.success ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-E7-E8⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ 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) A Proof Obligation
rely-reflexive listp(orl + qrl, vs, ps, owns) ∧ ¬ dups(orl + qrl) ∧ markedp(orl, ps) ∧ markedp(orl, vs) ∧ unmarkedp(qrl, ps) ∧ orl ≠ [] ∧ phead ∈ orl ∧ rvownerok(vretRefs, vrvHp, rvowns) ∧ allocrv(vretRefs, vrvHp) ∧ nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs) ∧ rvownerok(pretRefs, prvHp, rvowns) ∧ allocrv(pretRefs, prvHp) ∧ dom vrvHp = dom prvHp ∧ ( vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val)) ∧ (orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs)) ∧ (vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[(orl + qrl).last].next = null) ⊦ (∃ rl. orl + qrl + rl = orl + qrl) ∧ (∃ rl0. orl + rl0 = orl) ∧ vtail ∈ orl + qrl from vtail ∧ phead ∈ orl + qrl from phead ∧ vhead ∈ orl + qrl from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps) ∧ equalowns(vs, ps, owns, tid, vs, ps, owns) ∧ vretRefs(tid) = vretRefs(tid) ∧ (pretRefs(tid) = pretRefs(tid) ∨ vretRefs(tid) = pretRefs(tid)) ∧ rvownsrely(tid, rvowns, rvowns, vrvHp) ∧ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp) ∧ dom vrvHp ⊆ dom vrvHp ∧ prvHpRely(vrvHp, prvHp, prvHp) ∧ noidRely(tid, orl + qrl, vs, orl + qrl, vs) ∧ nextnottidRely(tid, vhead, vs, vhead, vs) ∧ ownsRely(tid, owns, owns) A Proof Obligation
stable-D17⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.nxt = gs0.ps[ls.lst].next ∧ ls.nxt = gs0.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-D23⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = gs0.vrvHp[ls.rvref]) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
DMSQInv-atDoEnqDMSQInv(gs, lsf, pcf), gs.vs[(gs.orl + gs.qrl).last].next ≠ null ⊦ ( pcf(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid) = E10 ∧ lsf(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid).success ∨ pcf(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid) = E11) ∧ lsf(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid).node = gs.vs[(gs.orl + gs.qrl).last].next ∧ lsf(gs.owns(gs.vs[(gs.orl + gs.qrl).last].next).tid).lst = gs.vtail ∧ gs.vtail = (gs.orl + gs.qrl).last A User Theorem
step-ready-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)) ∧ pre(gs, ls, ready, a) ∧ pcstepf(gs, ls, ready, a) = E1 → ( 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) A Proof Obligation
step-E1-E2⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) A Proof Obligation
definedness-FLUSHVAL⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null → r ∈ gs.ps ∧ r ∈ gs.vs A Proof Obligation
copied-DMSQInv-thm ⊦ DMSQInv(gs, lsf, pcf) ∧ DMSQstep(mkstate(gs, lsf, pcf), a, mkstate(gs0, lsf0, pcf0)) → DMSQInv(gs0, lsf0, pcf0) A User Theorem
step-D12-D13⊦ ( (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) A Proof Obligation
step-E8-E14⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ 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) A Proof Obligation
definedness-D9⊦ ( 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) → ls.first ∈ gs.ps ⊕ gs.vs A Proof Obligation
step-D20-D21⊦ ( ( ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[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) A Proof Obligation
step-D6-D7⊦ ( ( (ls.success → ls.optval = gs.vrvHp[ls.rvref] ∧ ls.optval = 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) A Proof Obligation
step-D11-D18⊦ ( ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (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) A Proof Obligation
step-FLUSHRVHP⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
rely-D30-D31⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D30, a).orl) ∧ gstepf(gs, ls, D30, a).vtail ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vtail ∧ gstepf(gs, ls, D30, a).phead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.phead ∧ gstepf(gs, ls, D30, a).vhead ∈ gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D30, a).vs, gstepf(gs, ls, D30, a).ps, gstepf(gs, ls, D30, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D30, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D30, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D30, a).vretRefs, gstepf(gs, ls, D30, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D30, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D30, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D30, a).orl + gstepf(gs, ls, D30, a).qrl, gstepf(gs, ls, D30, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D30, a).vhead, gstepf(gs, ls, D30, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D30, a).owns) A Proof Obligation
stable-D26⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID ≠ None ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ ls.optval = Val(gs0.vs[ls.nxt].val) ∧ (gs0.vhead = ls.first → gs0.rvowns(gs0.vretRefs(ls.othertid)) = Claimed(ls.othertid, ls.optval.val))) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-D32⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
rely-FLUSHRVHP⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null) ∧ gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
stable-E10⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ ( ¬ ls.success → ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ 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) )) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.success → gs0.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.ps[ls.lst].next = ls.node)) ∧ ( ¬ ls.success → ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ gs0.owns(ls.node) = Some(ls.tid) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node]) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (ls.success ⊃ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns)) ;oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) ) A Proof Obligation
stable-D11⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs0.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D24-D6⊦ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ 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) A Proof Obligation
rely-D16-D17⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D16, a).orl) ∧ gstepf(gs, ls, D16, a).vtail ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vtail ∧ gstepf(gs, ls, D16, a).phead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.phead ∧ gstepf(gs, ls, D16, a).vhead ∈ gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D16, a).vs, gstepf(gs, ls, D16, a).ps, gstepf(gs, ls, D16, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D16, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D16, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D16, a).vretRefs, gstepf(gs, ls, D16, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D16, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D16, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D16, a).orl + gstepf(gs, ls, D16, a).qrl, gstepf(gs, ls, D16, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D16, a).vhead, gstepf(gs, ls, D16, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D16, a).owns) A Proof Obligation
step-D11-D12⊦ ( ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (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) A Proof Obligation
step-E8-E9⊦ ( ( gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ 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) A Proof Obligation
stable-E7⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( gs0.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs0.vs[ls.lst].next) ∧ (gs0.vs[ls.lst].next = null → gs0.vtail = ls.lst)) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
stable-D20⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) )) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = Val(gs0.vs[ls.nxt].val) ∧ (gs0.qrl ≠ [] ∧ gs0.vs[gs0.qrl.head].deqID = Some(ls.tid) → gs0.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs0.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs0.ps[ls.nxt].deqID = None → gs0.vhead = ls.first) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ;gs0.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D27-D32⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.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) A Proof Obligation
listp-flushauxtid⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → listp(rl, vs, ps[vs[rl.last].next, ps[vs[rl.last].next].deqID:= vs[vs[rl.last].next].deqID], owns) A User Theorem
step-D34-ready⊦ ( ( ls.optval = gs.vrvHp[gs.vretRefs(ls.tid)] ∧ ls.optval = gs.prvHp[gs.pretRefs(ls.tid)] ∧ gs.vretRefs(ls.tid) = gs.pretRefs(ls.tid) ∧ gs.vretRefs(ls.tid) ∈ gs.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) A Proof Obligation
definedness-D14⊦ ( (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) → ls.rvref ∈ gs.vrvHp A Proof Obligation
rely-E9-E10⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E9, a).orl) ∧ gstepf(gs, ls, E9, a).vtail ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vtail ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.phead ∧ gstepf(gs, ls, E9, a).vhead ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E9, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E9, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E9, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E9, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E9, a).owns) A Proof Obligation
step-D7-D8⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) A Proof Obligation
rely-FLUSHOPTTID⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
stable-D14⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.vrvHp[ls.rvref] = Empty ∧ ls.nxt = null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
rely-D23-D24⊦ ls.tid ≠ tid0 ∧ ( (gs.ps[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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = 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 gs.vtail ∧ gstepf(gs, ls, D23, a).phead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.phead ∧ gstepf(gs, ls, D23, a).vhead ∈ gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D23, a).vs, gstepf(gs, ls, D23, a).ps, gstepf(gs, ls, D23, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D23, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D23, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D23, a).vretRefs, gstepf(gs, ls, D23, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D23, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D23, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D23, a).orl + gstepf(gs, ls, D23, a).qrl, gstepf(gs, ls, D23, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D23, a).vhead, gstepf(gs, ls, D23, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D23, a).owns) A Proof Obligation
step-E2-E3⊦ ( 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) A Proof Obligation
stable-E13⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
step-D10-D11⊦ ( ( gs.vtail ∈ gs.orl + gs.qrl from ls.lst ∧ (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) A Proof Obligation
stable-D5⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-E14-E15⊦ ( (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) A Proof Obligation
rely-D14-D15⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D14, a).orl) ∧ gstepf(gs, ls, D14, a).vtail ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vtail ∧ gstepf(gs, ls, D14, a).phead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.phead ∧ gstepf(gs, ls, D14, a).vhead ∈ gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D14, a).vs, gstepf(gs, ls, D14, a).ps, gstepf(gs, ls, D14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D14, a).vretRefs, gstepf(gs, ls, D14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D14, a).orl + gstepf(gs, ls, D14, a).qrl, gstepf(gs, ls, D14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D14, a).vhead, gstepf(gs, ls, D14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D14, a).owns) A Proof Obligation
rely-D22-D23⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = 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 gs.vtail ∧ gstepf(gs, ls, D22, a).phead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.phead ∧ gstepf(gs, ls, D22, a).vhead ∈ gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D22, a).vs, gstepf(gs, ls, D22, a).ps, gstepf(gs, ls, D22, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D22, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D22, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D22, a).vretRefs, gstepf(gs, ls, D22, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D22, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D22, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D22, a).orl + gstepf(gs, ls, D22, a).qrl, gstepf(gs, ls, D22, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D22, a).vhead, gstepf(gs, ls, D22, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D22, a).owns) A Proof Obligation
stable-E4⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ¬ ls.success → ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl ∧ ls.node ≠ null ∧ ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ gs0.owns(ls.node) = Some(ls.tid) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node]) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (ls.success ⊃ noowns(ls.tid, gs0.owns);oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps)) A Proof Obligation
step-D1-D2⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) A Proof Obligation
stable-D8⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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 ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.vtail ∈ gs0.orl + gs0.qrl from ls.first ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-D17⊦ ( (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) → (gs.vtail = ls.lst ⊃ true;true) A Proof Obligation
definedness-D23⊦ ( (gs.ps[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) → ls.rvref ∈ gs.vrvHp A Proof Obligation
definedness-FLUSHRVHP⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ rvref ∈ gs.vrvHp ∧ rvref ∈ gs.prvHp ∧ rvref ≠ null → rvref ∈ gs.vrvHp A Proof Obligation
rely-D13-D14⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D13, a).orl) ∧ gstepf(gs, ls, D13, a).vtail ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vtail ∧ gstepf(gs, ls, D13, a).phead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.phead ∧ gstepf(gs, ls, D13, a).vhead ∈ gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D13, a).vs, gstepf(gs, ls, D13, a).ps, gstepf(gs, ls, D13, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D13, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D13, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D13, a).vretRefs, gstepf(gs, ls, D13, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D13, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D13, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D13, a).orl + gstepf(gs, ls, D13, a).qrl, gstepf(gs, ls, D13, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D13, a).vhead, gstepf(gs, ls, D13, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D13, a).owns) A Proof Obligation
rely-D21-D22⊦ ls.tid ≠ tid0 ∧ ( ( ls.nxt ≠ null ∧ ls.first ∈ gs.orl ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = 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 gs.vtail ∧ gstepf(gs, ls, D21, a).phead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.phead ∧ gstepf(gs, ls, D21, a).vhead ∈ gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D21, a).vs, gstepf(gs, ls, D21, a).ps, gstepf(gs, ls, D21, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D21, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D21, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D21, a).vretRefs, gstepf(gs, ls, D21, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D21, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D21, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D21, a).orl + gstepf(gs, ls, D21, a).qrl, gstepf(gs, ls, D21, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D21, a).vhead, gstepf(gs, ls, D21, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D21, a).owns) A Proof Obligation
stable-D31⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.first ∈ gs0.orl ∧ gs0.ps[ls.nxt].deqID ≠ None ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
rely-FLUSHRETREF⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
init-state-inv ( (∃ r, value. r ≠ null ∧ gs.ps = ∅[r, mk(value, Some(dummytid), null)] ∧ gs.phead = r ∧ gs.vhead = r ∧ gs.vtail = r ∧ gs.orl = r ' ∧ gs.qrl = [] ∧ gs.vs = gs.ps) ∧ gs.vrvHp = ∅ ∧ gs.prvHp = ∅ ∧ gs.vretRefs = (λ tid. null) ∧ gs.pretRefs = (λ tid. null) ∧ gs.owns = (λ r. None) ∧ pcf = (λ tid. idle)) ∧ (∀ tid. tid = lsf(tid).tid) ⊦ DMSQInv(gs, lsf, pcf) A Proof Obligation
step-D8-D9⊦ ( 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) A Proof Obligation
stable-D13⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.nxt = null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D29-D30⊦ ( ( ls.first ∈ gs.orl ∧ gs.ps[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) A Proof Obligation
stable-D28⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ gs0.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs0.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-E11-E12⊦ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[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) A Proof Obligation
stable-D34⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.optval = gs0.vrvHp[gs0.vretRefs(ls.tid)] ∧ ls.optval = gs0.prvHp[gs0.pretRefs(ls.tid)] ∧ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = (ls.optval = Empty ⊃ Pending(ls.tid);Claimed(ls.tid, ls.optval.val))) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-FLUSHHEAD⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.phead:= gs.vhead → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
stable-E12⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.success ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.node ∈ gs0.orl + gs0.qrl ∧ gs0.vs[ls.lst].next = ls.node ∧ gs0.ps[ls.lst].next = ls.node ∧ ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D2-D3⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) A Proof Obligation
copied-rely-DMSQLInv ⊦ ls.tid ≠ tid0 ∧ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQRely(gs, tid0, gs0) A User Theorem
other-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ ls.tid ≠ ls0.tid ∧ DMSQLInv(gs, ls0, pc0) ∧ lstep(gs, ls, pc, a, gs0, ls1, pc1) → DMSQLInv(gs0, ls0, pc0) An Axiom
rely-E1-E2⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl) ∧ gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead ∧ gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns) A Proof Obligation
listp-flushauxnxt⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → listp(rl, vs, ps[vs[rl.last].next, ps[vs[rl.last].next].next:= vs[vs[rl.last].next].next], owns) A User Theorem
listp-crash ⊦ listp(rl, vs, ps, owns) → listp(rl, ps, ps, λ r. None) A User Theorem
step-ready-D1⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) A Proof Obligation
step-D28-D29⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.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) A Proof Obligation
rely-D31-D6⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D31, a).orl) ∧ gstepf(gs, ls, D31, a).vtail ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vtail ∧ gstepf(gs, ls, D31, a).phead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.phead ∧ gstepf(gs, ls, D31, a).vhead ∈ gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D31, a).vs, gstepf(gs, ls, D31, a).ps, gstepf(gs, ls, D31, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D31, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D31, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D31, a).vretRefs, gstepf(gs, ls, D31, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D31, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D31, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D31, a).orl + gstepf(gs, ls, D31, a).qrl, gstepf(gs, ls, D31, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D31, a).vhead, gstepf(gs, ls, D31, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D31, a).owns) A Proof Obligation
step-E16-E4⊦ ( 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) ) A Proof Obligation
step-D27-D28⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.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) A Proof Obligation
stable-E15⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.nxt = gs0.vs[ls.lst].next ∧ ls.nxt = gs0.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
stable-D22⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-D16⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ ls.nxt = gs0.vs[ls.lst].next ∧ ls.nxt ≠ null) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
rely-E15-E4⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns) A Proof Obligation
stable-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc) An Axiom
step-D32-D6⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) A Proof Obligation
step-E10-E11⊦ ( ( ls.success → gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[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) ) A Proof Obligation
step-E12-E4⊦ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.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) ) A Proof Obligation
step-E1-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)) ∧ 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) A Proof Obligation
step-D19-D20⊦ ( (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) A Proof Obligation
definedness-D31⊦ ( (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) → (gs.vhead = ls.first ⊃ true;true) A Proof Obligation
step-D26-D27⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ gs.vs[ls.nxt].deqID = Some(ls.othertid) ∧ 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) A Proof Obligation
stable-E6⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ (gs0.ps[ls.lst].next = null → ls.lst = gs0.vtail)) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
stable-crashed⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-E17-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, 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) A Proof Obligation
definedness-D19⊦ ( (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) → ls.nxt ∈ gs.ps ⊕ gs.vs ∧ ((gs.ps ⊕ gs.vs)[ls.nxt].deqID = None ⊃ ls.nxt ∈ gs.vs ∧ (∀ addr. (gs.vretRefs(ls.tid) = addr ⊃ ls.optval ≠ Empty;true));true) A Proof Obligation
step-D17-D6⊦ ( (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) A Proof Obligation
rely-FLUSHVAL⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
rely-E14-E15⊦ ls.tid ≠ tid0 ∧ ( (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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E14, a).orl) ∧ gstepf(gs, ls, E14, a).vtail ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vtail ∧ gstepf(gs, ls, E14, a).phead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.phead ∧ gstepf(gs, ls, E14, a).vhead ∈ gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E14, a).vs, gstepf(gs, ls, E14, a).ps, gstepf(gs, ls, E14, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E14, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E14, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E14, a).vretRefs, gstepf(gs, ls, E14, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E14, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E14, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E14, a).orl + gstepf(gs, ls, E14, a).qrl, gstepf(gs, ls, E14, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E14, a).vhead, gstepf(gs, ls, E14, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E14, a).owns) A Proof Obligation
stable-D19⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-D25⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs0.vs[ls.nxt].val) ∧ ( gs0.vhead = ls.first → gs0.rvowns(gs0.vretRefs((gs0.ps ⊕ gs0.vs)[ls.nxt].deqID.tid)) = Claimed((gs0.ps ⊕ gs0.vs)[ls.nxt].deqID.tid, ls.optval.val))) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
step-D15-D6⊦ ( (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) A Proof Obligation
rely-E2-E3⊦ ls.tid ≠ tid0 ∧ ( 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E2, a).orl) ∧ gstepf(gs, ls, E2, a).vtail ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vtail ∧ gstepf(gs, ls, E2, a).phead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.phead ∧ gstepf(gs, ls, E2, a).vhead ∈ gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E2, a).vs, gstepf(gs, ls, E2, a).ps, gstepf(gs, ls, E2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E2, a).vretRefs, gstepf(gs, ls, E2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E2, a).orl + gstepf(gs, ls, E2, a).qrl, gstepf(gs, ls, E2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E2, a).vhead, gstepf(gs, ls, E2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E2, a).owns) A Proof Obligation
rely-D2-D3⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D2, a).orl) ∧ gstepf(gs, ls, D2, a).vtail ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D2, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D2, a).owns) A Proof Obligation
stable-D10⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst ∧ (ls.nxt ≠ null → ls.nxt = gs0.vs[ls.first].next) ∧ (ls.first ≠ ls.lst → ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-D25⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → 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) → (weak?((gs.ps ⊕ gs.vs)[ls.nxt].deqID) ∨ some?((gs.ps ⊕ gs.vs)[ls.nxt].deqID)) ∧ ls.nxt ∈ gs.ps ⊕ gs.vs A Proof Obligation
step-E3-E4⊦ ( 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) ) A Proof Obligation
step-D3-D4⊦ ( (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) A Proof Obligation
stable-D1⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-E9⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (gs0.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs0.orl + gs0.qrl ∧ (gs0.vs[ls.lst].next = null → gs0.vtail = ls.lst)) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ gs0.ps[ls.node] = gs0.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
copied-step-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ lstep(gs, ls, pc, a, gs0, ls0, pc0) → DMSQGInv(gs0) ∧ DMSQLInv(gs0, ls0, pc0) ∧ ls.tid = ls0.tid A User Theorem
step-CRASH⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) → ⟪ps := gs.ps, phead := gs.phead, pretRefs := gs.pretRefs, prvHp := gs.prvHp, vs := gs.vs, vhead := gs.vhead, vtail := gs.vtail, vretRefs := gs.vretRefs, vrvHp := gs.vrvHp, owns := gs.owns; CRASH(ps, phead, pretRefs, prvHp; vs, vhead, vtail, vretRefs, vrvHp, owns, pcf); gs := (((((gs.vs:= vs).vhead:= vhead).vtail:= vtail).vretRefs:= vretRefs).vrvHp:= vrvHp).owns:= owns⟫ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid))) A Proof Obligation
definedness-E9⊦ ( (gs.owns(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) → ls.lst ∈ gs.ps ⊕ gs.vs ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.lst ∈ gs.vs;true) A Proof Obligation
step-D25-D26⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ gs.vs[ls.nxt].deqID ≠ None ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ ( gs.vhead = ls.first → 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) A Proof Obligation
stable-D4⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ noowns(ls.tid, gs.owns)) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid) ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ∈ gs0.prvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
definedness-FLUSHOPTTID⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null → (r ∈ gs.ps ∧ r ∈ gs.vs) ∧ ((gs.qrl ≠ [] → gs.qrl ≠ [] ∧ (r = gs.qrl.head → r ∈ gs.vs)) ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl ≠ [];true)) ∧ (gs.qrl ≠ [] → gs.qrl ≠ [] ∧ (r = gs.qrl.head → r ∈ gs.vs)) ∧ (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl ≠ [];true) A Proof Obligation
copied-stable-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ DMSQGInv(gs0) ∧ DMSQRely(gs, ls.tid, gs0) → DMSQLInv(gs0, ls, pc) A User Theorem
rely-E1-E1⊦ ls.tid ≠ tid0 ∧ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E1, a).orl) ∧ gstepf(gs, ls, E1, a).vtail ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vtail ∧ gstepf(gs, ls, E1, a).phead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.phead ∧ gstepf(gs, ls, E1, a).vhead ∈ gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E1, a).vs, gstepf(gs, ls, E1, a).ps, gstepf(gs, ls, E1, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E1, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E1, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E1, a).vretRefs, gstepf(gs, ls, E1, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E1, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E1, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E1, a).orl + gstepf(gs, ls, E1, a).qrl, gstepf(gs, ls, E1, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E1, a).vhead, gstepf(gs, ls, E1, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E1, a).owns) A Proof Obligation
definedness-D28⊦ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.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) → ls.nxt ∈ gs.ps ∧ (ls.nxt ∈ gs.ps ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl ≠ [];true)) ∧ ls.nxt ∈ gs.ps ∧ (gs.ps[ls.nxt].deqID = None ⊃ gs.qrl ≠ [];true) A Proof Obligation
definedness-E12⊦ ( ( ls.success ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.node ∈ gs.orl + gs.qrl ∧ gs.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) → (gs.vtail = ls.lst ⊃ true;true) A Proof Obligation
step-D20-D25⊦ ( ( ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[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) A Proof Obligation
step-E4-E5⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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) A Proof Obligation
step-D4-D5⊦ ( ( gs.vretRefs(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) A Proof Obligation
definedness-E15⊦ ( (gs.owns(ls.node) = Some(ls.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) → (gs.vtail = ls.lst ⊃ true;true) A Proof Obligation
stable-E3⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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.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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → gs0.owns(ls.node) = Some(ls.tid) ∧ (ls.node ∈ gs0.ps ∧ ls.node ∈ gs0.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs0.orl ∧ ¬ ls.node ∈ gs0.qrl) ∧ gs0.vs[ls.node] = mk(ls.value, None, null) ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ oneowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps) A Proof Obligation
step-FLUSHOPTTID⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].deqID:= gs.vs[r].deqID]) .orl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.orl + gs.qrl.head;gs.orl)) .qrl:= (gs.qrl ≠ [] ∧ r = gs.qrl.head ∧ gs.vs[r].deqID ≠ None ⊃ gs.qrl.tail;gs.qrl) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
definedness-D16⊦ ( (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) → (ls.lst ∈ gs.ps ∧ ls.lst ∈ gs.vs) ∧ gs.orl + gs.qrl ≠ [] ∧ gs.orl + gs.qrl ≠ [] A Proof Obligation
step-FLUSHNEXT⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
rely-E3-E4⊦ ls.tid ≠ tid0 ∧ ( 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E3, a).orl) ∧ gstepf(gs, ls, E3, a).vtail ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vtail ∧ gstepf(gs, ls, E3, a).phead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.phead ∧ gstepf(gs, ls, E3, a).vhead ∈ gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E3, a).vs, gstepf(gs, ls, E3, a).ps, gstepf(gs, ls, E3, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E3, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E3, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E3, a).vretRefs, gstepf(gs, ls, E3, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E3, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E3, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E3, a).orl + gstepf(gs, ls, E3, a).qrl, gstepf(gs, ls, E3, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E3, a).vhead, gstepf(gs, ls, E3, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E3, a).owns) A Proof Obligation
DMSQInv-atDoDeqDMSQInv(gs, lsf, pcf), gs.qrl ≠ [], some?(gs.vs[gs.qrl.head].deqID) ⊦ (pcf(gs.vs[gs.qrl.head].deqID.tid) = D20 ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).success ∨ pcf(gs.vs[gs.qrl.head].deqID.tid) = D21) ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).nxt = gs.qrl.head ∧ lsf(gs.vs[gs.qrl.head].deqID.tid).first = gs.orl.last ∧ gs.orl.last = gs.vhead A User Theorem
rely-FLUSHHEAD⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ gs0 = gs.phead:= gs.vhead → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
rely-D24-D6⊦ ls.tid ≠ tid0 ∧ ( ( gs.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ 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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D24, a).orl) ∧ gstepf(gs, ls, D24, a).vtail ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vtail ∧ gstepf(gs, ls, D24, a).phead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.phead ∧ gstepf(gs, ls, D24, a).vhead ∈ gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D24, a).vs, gstepf(gs, ls, D24, a).ps, gstepf(gs, ls, D24, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D24, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D24, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D24, a).vretRefs, gstepf(gs, ls, D24, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D24, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D24, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D24, a).orl + gstepf(gs, ls, D24, a).qrl, gstepf(gs, ls, D24, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D24, a).vhead, gstepf(gs, ls, D24, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D24, a).owns) A Proof Obligation
step-idle-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, 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) A Proof Obligation
definedness-E3⊦ ( 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) → ls.node ∈ gs.vs A Proof Obligation
copied-other-DMSQLInv ⊦ DMSQGInv(gs) ∧ DMSQLInv(gs, ls, pc) ∧ ls.tid ≠ ls0.tid ∧ DMSQLInv(gs, ls0, pc0) ∧ lstep(gs, ls, pc, a, gs0, ls1, pc1) → DMSQLInv(gs0, ls0, pc0) A User Theorem
rely-D28-D29⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ ls.nxt ≠ null ∧ ls.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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D28, a).orl) ∧ gstepf(gs, ls, D28, a).vtail ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vtail ∧ gstepf(gs, ls, D28, a).phead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.phead ∧ gstepf(gs, ls, D28, a).vhead ∈ gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D28, a).vs, gstepf(gs, ls, D28, a).ps, gstepf(gs, ls, D28, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D28, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D28, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D28, a).vretRefs, gstepf(gs, ls, D28, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D28, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D28, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D28, a).orl + gstepf(gs, ls, D28, a).qrl, gstepf(gs, ls, D28, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D28, a).vhead, gstepf(gs, ls, D28, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D28, a).owns) A Proof Obligation
stable-D24⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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]) ∧ (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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( gs0.ps[ls.nxt].deqID ≠ None ∧ ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ ls.optval = gs0.vrvHp[ls.rvref] ∧ ls.optval = gs0.prvHp[ls.rvref]) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ ( ls.success ∧ gs0.vretRefs(ls.tid) ∈ gs0.vrvHp ∧ gs0.vretRefs(ls.tid) ≠ null ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ (gs0.vhead ≠ ls.first → nextnottid(ls.tid, gs0.vhead, gs0.vs)) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.nxt, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
rely-D29-D30⊦ ls.tid ≠ tid0 ∧ ( ( ls.first ∈ gs.orl ∧ gs.ps[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 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, D29, a).orl) ∧ gstepf(gs, ls, D29, a).vtail ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vtail ∧ gstepf(gs, ls, D29, a).phead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.phead ∧ gstepf(gs, ls, D29, a).vhead ∈ gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, D29, a).vs, gstepf(gs, ls, D29, a).ps, gstepf(gs, ls, D29, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, D29, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, D29, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, D29, a).vretRefs, gstepf(gs, ls, D29, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, D29, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, D29, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, D29, a).orl + gstepf(gs, ls, D29, a).qrl, gstepf(gs, ls, D29, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, D29, a).vhead, gstepf(gs, ls, D29, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, D29, a).owns) A Proof Obligation
step-E9-E10⊦ ( (gs.owns(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) ) A Proof Obligation
rely-FLUSHNEXT⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = ( (gs.ps:= gs.ps[r, gs.ps[r].next:= gs.vs[r].next]) .qrl:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.qrl + gs.vs[r].next;gs.qrl)) .owns:= (r = (gs.orl + gs.qrl).last ∧ gs.vs[r].next ≠ null ⊃ gs.owns(gs.vs[r].next; None);gs.owns) → (∀ tid0. (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(tid0) = gs0.vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gs0.pretRefs(tid0) ∨ gs.vretRefs(tid0) = gs0.pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(tid0, gs.owns, gs0.owns)) A Proof Obligation
step-FLUSHVAL⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ (r ∈ gs.vs ∧ r ∈ gs.ps ∧ r ≠ null) ∧ gs0 = gs.ps:= gs.ps[r, gs.ps[r].val:= gs.vs[r].val] → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
step-D9-D10⊦ ( 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) A Proof Obligation
step-D23-D24⊦ ( (gs.ps[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) A Proof Obligation
definedness-E6⊦ ( (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) → ls.lst ∈ gs.ps ⊕ gs.vs A Proof Obligation
Relypred-reflexive ⊦ DMSQGInv(gs) → DMSQRely(gs, tid, gs) A User Theorem
listp-flushauxval ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → listp(rl, vs, ps[vs[rl.last].next, ps[vs[rl.last].next].val:= vs[vs[rl.last].next].val], owns) A User Theorem
step-D18-D19⊦ ( (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) A Proof Obligation
stable-D12⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → (ls.lst ∈ gs0.orl + gs0.qrl ∧ (ls.nxt ≠ null → ls.nxt = gs0.vs[ls.lst].next)) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ∈ gs0.orl ∧ gs0.vhead ∈ gs0.orl from ls.first) ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, ls.first, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation
stable-E11⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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)) ∧ 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))) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.success ∧ gs0.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.ps[ls.lst].next = ls.node)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns)) A Proof Obligation
step-E5-E6⊦ ( 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) A Proof Obligation
step-FLUSHRETREF⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ DMSQLInv(gs, lsf(tid), pcf(tid)) ∧ gs0 = gs.pretRefs:= gs.pretRefs(tid; gs.vretRefs(tid)) → listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null) A Proof Obligation
step-D5-D6⊦ ( 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) A Proof Obligation
step-D22-D23⊦ ( (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) A Proof Obligation
step-D30-D31⊦ ( ( ls.first ∈ gs.orl ∧ gs.ps[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) A Proof Obligation
step-D2-D2⊦ ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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) A Proof Obligation
stable-D27⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.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))) ∧ (¬ 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)) ∧ 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)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.first ∈ gs0.orl ∧ ls.nxt ≠ null ∧ ls.nxt = gs0.ps[ls.first].next ∧ gs0.vs[ls.nxt].deqID = Some(ls.othertid) ∧ (gs0.vhead = ls.first → gs0.rvowns(ls.addr) = Claimed(ls.othertid, ls.optval.val))) ∧ (¬ ls.success ∧ gs0.rvowns(gs0.vretRefs(ls.tid)) = Pending(ls.tid)) ∧ (ls.first ≠ ls.lst ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from ls.lst) ∧ ls.lst ∈ gs0.orl + gs0.qrl from ls.first ∧ (gs0.vretRefs(ls.tid) = ls.rvref ∧ gs0.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs0.vrvHp ∧ ls.rvref ≠ null) ∧ (ls.addr ∈ gs0.vrvHp ∧ ls.addr ≠ null ∧ ls.optval = Val(gs0.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ noowns(ls.tid, gs0.owns) A Proof Obligation