| ⊦ 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) |
dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D2, a) = D2, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ (∃ 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)
| dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D2, a) = D2, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D2, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null ⊦ (∃ 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) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ 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.prvHp ⊆ 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)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D2, a) ↔ (∃ rvref0, optval00. (¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null) ∧ a = chooseD2(rvref0, optval00)) ∨ a = τ ∧ ¬ (∃ rvref0, optval00. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null); (s) ⊦ D2 ≠ D3; (s) ⊦ pcstepf(gs, ls, D2, a) = (∃ rvref0, optval00. a = chooseD2(rvref0, optval00) ⊃ D3;D2); (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ gs.vrvHp ∧ ¬ rvref0 ∈ gs.prvHp ∧ rvref0 ≠ null), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ 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.prvHp ⊆ 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) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. 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 vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(vs, ps, owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, gstepf(gs, ls, D2, a).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom prvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(vrvHp, prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, orl + qrl, vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, vhead, vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, owns, gstepf(gs, ls, D2, a).owns)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl) ∧ (∃ rl0. 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 vtail ∧ gstepf(gs, ls, D2, a).phead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from phead ∧ gstepf(gs, ls, D2, a).vhead ∈ gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps) ∧ equalowns(vs, ps, owns, tid0, gstepf(gs, ls, D2, a).vs, gstepf(gs, ls, D2, a).ps, gstepf(gs, ls, D2, a).owns) ∧ vretRefs(tid0) = gstepf(gs, ls, D2, a).vretRefs(tid0) ∧ (pretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0) ∨ vretRefs(tid0) = gstepf(gs, ls, D2, a).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, gstepf(gs, ls, D2, a).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, gstepf(gs, ls, D2, a).vretRefs, gstepf(gs, ls, D2, a).vrvHp) ∧ dom prvHp ⊆ dom gstepf(gs, ls, D2, a).vrvHp ∧ prvHpRely(vrvHp, prvHp, gstepf(gs, ls, D2, a).prvHp) ∧ noidRely(tid0, orl + qrl, vs, gstepf(gs, ls, D2, a).orl + gstepf(gs, ls, D2, a).qrl, gstepf(gs, ls, D2, a).vs) ∧ nextnottidRely(tid0, vhead, vs, gstepf(gs, ls, D2, a).vhead, gstepf(gs, ls, D2, a).vs) ∧ ownsRely(tid0, owns, gstepf(gs, ls, D2, a).owns) |
dom vrvHp = dom prvHp, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl) ∧ (∃ rl0. orl + rl0 = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl) ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vtail ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from vtail ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).phead ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from phead ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vhead ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from vhead ∧ equalrl (orl + qrl, vs, ps, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).ps) ∧ equalowns (vs, ps, owns, tid0, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).ps, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).owns) ∧ vretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vretRefs(tid0) ∧ ( pretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).pretRefs(tid0) ∨ vretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).pretRefs(tid0)) ∧ rvownsrely (tid0, rvowns, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vretRefs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vrvHp) ∧ dom prvHp ⊆ dom gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vrvHp ∧ prvHpRely(vrvHp, prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).prvHp) ∧ noidRely (tid0, orl + qrl, vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs) ∧ nextnottidRely (tid0, vhead, vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vhead, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs) ∧ ownsRely(tid0, owns, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ
| dom vrvHp = dom prvHp, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl) ∧ (∃ rl0. orl + rl0 = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl) ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vtail ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from vtail ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).phead ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from phead ∧ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vhead ∈ gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl from vhead ∧ equalrl (orl + qrl, vs, ps, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).ps) ∧ equalowns (vs, ps, owns, tid0, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).ps, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).owns) ∧ vretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vretRefs(tid0) ∧ ( pretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).pretRefs(tid0) ∨ vretRefs(tid0) = gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).pretRefs(tid0)) ∧ rvownsrely (tid0, rvowns, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vretRefs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vrvHp) ∧ dom prvHp ⊆ dom gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vrvHp ∧ prvHpRely(vrvHp, prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).prvHp) ∧ noidRely (tid0, orl + qrl, vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).orl + gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).qrl, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs) ∧ nextnottidRely (tid0, vhead, vs, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vhead, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).vs) ∧ ownsRely(tid0, owns, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a).owns) |
dom vrvHp = dom prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gstepf (mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| dom vrvHp = dom prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp = dom prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ( (tid = ls.tid ∧ value = ls.value) ∧ optval = ls.optval) ∧ node = ls.node) ∧ nd = ls.nd) ∧ (success ↔ ls.success)) ∧ lst = ls.lst) ∧ nxt = ls.nxt) ∧ rvref = ls.rvref) ∧ optval0 = ls.optval0) ∧ first = ls.first) ∧ othertid = ls.othertid) ∧ addr = ls.addr ↔ ls = mkls (tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr); (elim) Used terms: value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| dom vrvHp = dom prvHp, gstepf(mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls, D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
| dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
a = τ, dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
a = chooseD2(rvref1, optval1), dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: DMSQAction freely generated by globalCRASH, globalFLUSHHEAD, τ, callRUN, checkEmp, chooseD2, chooseE1, doDeq, doDeqEmpty, doEnq, globalFLUSHVAL, invDEQ, invENQ, retDEQ, retENQ ;; ⊦ chooseD2(rvref, optval) ≠ retENQ(tid); (s) ⊦ retENQ(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ retDEQ(tid, optval0); (s) ⊦ retDEQ(tid, optval) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ invENQ(tid, invENQvalue); (s) ⊦ invENQ(tid, invENQvalue) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ invDEQ(tid); (s) ⊦ invDEQ(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ globalFLUSHVAL(node); (s) ⊦ globalFLUSHVAL(node) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ doEnq(tid); (s) ⊦ doEnq(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ doDeqEmpty(tid); (s) ⊦ doDeqEmpty(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ doDeq(tid); (s) ⊦ doDeq(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ chooseE1(node, nd, success); (s) ⊦ chooseE1(node, nd, success) ≠ τ; (s) ⊦ checkEmp(tid) ≠ chooseD2(rvref, optval); (s) ⊦ checkEmp(tid) ≠ τ; (s) ⊦ callRUN(tid) ≠ chooseD2(rvref, optval); (s) ⊦ callRUN(tid) ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ globalFLUSHHEAD; (s) ⊦ globalFLUSHHEAD ≠ τ; (s) ⊦ chooseD2(rvref, optval) ≠ globalCRASH; (s) ⊦ globalCRASH ≠ τ; (s)
| a = τ, dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp0 = dom prvHp0, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws) ⊦ gstepf(gs, ls, D2, τ) = gs; (s)
| dom vrvHp0 = dom prvHp0, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
⊦ ∃ rvref. rvref ≠ null ∧ ¬ rvref ∈ prvHp
dom vrvHp0 = dom prvHp0, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∃ rvref. rvref ≠ null ∧ ¬ rvref ∈ prvHp0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used terms: prvHp0
| ⊦ ∃ rvref. rvref ≠ null ∧ ¬ rvref ∈ prvHp |
| dom vrvHp0 = dom prvHp0, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ∃ rvref. rvref ≠ null ∧ ¬ rvref ∈ prvHp0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
dom vrvHp0 = dom prvHp0, orl0 ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvref ∈ prvHp0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
| dom vrvHp0 = dom prvHp0, orl0 ≠ [], rvref ≠ null, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvref ∈ prvHp0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ∃ rvref0. ¬ rvref0 ∈ vrvHp0 ∧ ¬ rvref0 ∈ prvHp0 ∧ rvref0 ≠ null, vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
Used simplifier rules: ⊦ dom st0 = dom st1 ∧ a ∈ st0 → a ∈ st1; (ss) Used terms: rvref
| a = chooseD2(rvref1, optval1), dom vrvHp = dom prvHp, gstepf (mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), D2, a) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), 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), ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null ∧ a = chooseD2(rvref0, optval00) ∨ a = τ ∧ ¬(∃ rvref0. ¬ rvref0 ∈ vrvHp ∧ ¬ rvref0 ∈ prvHp ∧ rvref0 ≠ null), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ∃ rvref0, optval00. a = chooseD2(rvref0, optval00), (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
dom vrvHp = dom prvHp, orl0 ≠ [], rvref0 ≠ null, tid ≠ tid0, allocrv(vretRefs0, vrvHp), allocrv(pretRefs0, prvHp), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp, rvowns), rvownerok(pretRefs0, prvHp, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ∃ rvref, optval00. chooseD2(rvref0, optval1) = chooseD2(rvref, optval00), vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ rvownsrely(tid0, rvowns, rvowns(rvref0; Pending(tid)), vrvHp) ∧ rvrely(tid0, rvowns, vretRefs0, vrvHp, vretRefs0, vrvHp[rvref0, optval1]) ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref0, optval1])
Used simplifier rules: ⊦ s ⊆ s ++ a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ dom st[a, d] = dom st ++ a; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ chooseD2(rvref, optval) = chooseD2(rvref0, optval0) ↔ rvref = rvref0 ∧ optval = optval0; (ws) ⊦ chooseD2(rvref, optval) ≠ τ; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns:= rvowns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns0); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .tid = tid; (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval0:= optval2 = mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval2, node2, tid0, rvref0); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref:= rvref1 = mkls (tid, value, optval, node, nd, success, node0, node1, rvref1, optval0, node2, tid0, rvref0); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .rvref = rvref; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .rvowns = rvowns; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp:= vrvHp2 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp2, qrl, qrl0, owns, rvowns); (s) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .optval0 = optval0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .prvHp = vrvHp0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp:= vrvHp1 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp1, vrvHp0, qrl, qrl0, owns, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vrvHp = vrvHp; (s) ⊦ gstepf(gs, ls, D2, chooseD2(rvref0, optval00)) = ( ( gs .vrvHp:= gs.vrvHp [((ls.rvref:= rvref0).optval0:= optval00 ).rvref, ((ls.rvref:= rvref0).optval0:= optval00 ).optval0 ]) .prvHp:= gs.prvHp [((ls.rvref:= rvref0).optval0:= optval00).rvref, ((ls.rvref:= rvref0).optval0:= optval00).optval0 ]) .rvowns:= gs.rvowns (((ls.rvref:= rvref0).optval0:= optval00).rvref ; Pending(((ls.rvref:= rvref0).optval0:= optval00).tid) ); (s)
| dom vrvHp = dom prvHp, orl0 ≠ [], rvref0 ≠ null, tid ≠ tid0, allocrv(vretRefs0, vrvHp), allocrv(pretRefs0, prvHp), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns0), rvownerok(vretRefs0, vrvHp, rvowns), rvownerok(pretRefs0, prvHp, rvowns), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ rvref0 ∈ prvHp, ¬ rvref0 ∈ vrvHp, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ∃ rvref, optval00. chooseD2(rvref0, optval1) = chooseD2(rvref, optval00), vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 ∧ rvownsrely(tid0, rvowns, rvowns(rvref0; Pending(tid)), vrvHp) ∧ rvrely(tid0, rvowns, vretRefs0, vrvHp, vretRefs0, vrvHp[rvref0, optval1]) ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref0, optval1]) |
Used terms: rvref0, optval1
The following image shows the proof tree of sequent calculus. The proved goal is at the bottom. You can click on the nodes to view additional rules. See here for details on colors in a proof tree.