| ⊦ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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)) |
dom gs.vrvHp = dom gs.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], gs.orl ≠ [], rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ 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 ⊦ ∀ 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)
| dom gs.vrvHp = dom gs.prvHp, gs0 = gs.prvHp:= gs.prvHp[rvref, gs.vrvHp[rvref]], gs.orl ≠ [], rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, rvref ∈ gs.vrvHp, rvref ∈ gs.prvHp, ¬ 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 ⊦ ∀ 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) |
dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, 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), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs.prvHp[rvref, gs.vrvHp[rvref]])
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 ⊦ ownsRely(tid, owns, owns); (s) ⊦ (gs.prvHp:= vrvHp0).owns = gs.owns; (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.prvHp:= vrvHp0).vs = gs.vs; (s) ⊦ (gs.prvHp:= vrvHp0).vhead = gs.vhead; (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ (gs.prvHp:= vrvHp0).qrl = gs.qrl; (s) ⊦ (gs.prvHp:= vrvHp0).orl = gs.orl; (s) ⊦ (gs.prvHp:= vrvHp0).prvHp = vrvHp0; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.prvHp:= vrvHp0).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.prvHp:= vrvHp0).rvowns = gs.rvowns; (s) ⊦ (gs.prvHp:= vrvHp0).pretRefs = gs.pretRefs; (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ (gs.prvHp:= vrvHp0).ps = gs.ps; (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) ⊦ (gs.prvHp:= vrvHp0).phead = gs.phead; (s) ⊦ (gs.prvHp:= vrvHp0).vtail = gs.vtail; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ y ≠ [] → (x + y).last = y.last; (s)
| dom gs.vrvHp = dom gs.prvHp, gs.orl ≠ [], rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), rvref ∈ gs.prvHp, rvref ∈ gs.vrvHp, 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), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ gs.vtail ∈ gs.orl + gs.qrl from gs.vtail ∧ gs.vhead ∈ gs.orl + gs.qrl from gs.vhead ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs.prvHp[rvref, gs.vrvHp[rvref]]) |
dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]])
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), orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]]) |
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]])
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, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vtail ∈ orl + qrl from vtail ∧ vhead ∈ orl + qrl from vhead ∧ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]]) |
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]]), 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl from vtail, 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, 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 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, 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 ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, orl0
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = vhead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, orl ≠ [], qrl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl from (orl + qrl.butlast).last, 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| vs[(vhead0 ' + orl0).last].deqID = None, ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = orl1 + phead0 ', (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vhead0].deqID = None, vs[(vhead0 ' + orl0).last].deqID = None, vs[(vhead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl = orl1 + phead0 ', (orl + (vhead0 ' + orl0).butlast).last ≠ (vhead0 ' + orl0).last, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + vhead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + vhead0 ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ (orl + (vhead0 ' + orl0).butlast).last ∈ orl + vhead0 ' + orl0 from (orl + (vhead0 ' + orl0).butlast).last, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[vhead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[ps[phead0].next].deqID = None, vs[(ps[phead0].next ' + orl0).last].deqID = None, vs[(ps[phead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ (ps[phead0].next ' + orl0).last, ps[phead0].next ≠ phead0, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[ps[phead0].next].deqID = None, vs[(ps[phead0].next ' + orl0).last].deqID = None, vs[(ps[phead0].next ' + orl0).last].next = null, dom vrvHp = dom prvHp, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ (ps[phead0].next ' + orl0).last, ps[phead0].next ≠ phead0, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[orl0.last].deqID = None, ps[ps[phead0].next].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ orl0.last, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[phead0].next ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[orl0.last].deqID = None, ps[ps[phead0].next].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ≠ orl0.last, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ (phead0 ' + (ps[phead0].next ' + orl0).butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (phead0 ' + (ps[phead0].next ' + orl0).butlast).last, ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (ps[phead0].next ' + orl0.butlast).last ≠ orl0.last, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl0.butlast).last, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| ps[ps[phead0].next].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, dom vrvHp = dom prvHp, (ps[phead0].next ' + orl0.butlast).last ≠ orl0.last, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl0.butlast).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl0.butlast).last, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vhead0].deqID = None, ps[ps[phead0].next].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl + vhead0 ', (ps[phead0].next ' + orl).last ≠ vhead0, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl).last, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vhead0].deqID = None, ps[ps[phead0].next].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl + vhead0 ', (ps[phead0].next ' + orl).last ≠ vhead0, ps[phead0].next ≠ phead0, orl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl0, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl0, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ dups(orl1), ¬ dups(orl1 + orl0), ¬ ps[phead0].next ∈ orl0, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl0 from (ps[phead0].next ' + orl).last, 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), phead0 = vhead ∧ unmarkedp(orl0, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl0, vs), phead ∈ orl1 ∨ phead = phead0 ⊦ |
ps[ps[phead0].next].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, (ps[phead0].next ' + orl).last ≠ vhead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ vhead0, phead0 ≠ vhead0, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ' from (ps[phead0].next ' + orl).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl, vs) ⊦
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] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[ps[phead0].next].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, (ps[phead0].next ' + orl).last ≠ vhead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ vhead0, phead0 ≠ vhead0, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, ps, owns), markedp(orl1, ps), markedp(orl1, vs), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), unmarkedp(orl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ (ps[phead0].next ' + orl).last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ' from (ps[phead0].next ' + orl).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl, 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), phead ∈ orl1 ∨ phead = phead0, phead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[ps[phead0].next].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl.last ≠ vhead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ orl.last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ' from orl.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl, 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), phead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl, vs), phead ∈ orl1 ∨ phead = phead0 ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps[phead0].next ', orl
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[ps[phead0].next].deqID = None, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl.last ≠ vhead0, ps[phead0].next ≠ phead0, ps[phead0].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, ps, owns), markedp(orl1, vs), markedp(orl1, ps), nonullRetRefs((orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ', vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[phead0].deqID), some?(ps[phead0].deqID), unmarkedp(orl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(orl1 + orl), ¬ dups(orl1), ¬ dups(orl), ¬ phead0 ∈ orl1, ¬ orl.last ∈ (orl1 + phead0 ') + ps[phead0].next ' + orl + vhead0 ' from orl.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ ps[phead0].next ∈ orl, ¬ ps[phead0].next ∈ orl1, ¬ phead0 ∈ orl, 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), phead0 = vhead ∧ unmarkedp(orl, vs) ∨ orl1 ≠ [] ∧ orl1.last = vhead ∧ phead ≠ phead0 ∧ vs[ps[phead0].next].deqID = None ∧ unmarkedp(orl, vs), phead ∈ orl1 ∨ phead = phead0 ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ∈ rl1 + r ' + rl2 from r; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead1, y
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| dom vrvHp = dom prvHp, orl = qrl0 + vtail0 ', orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl from vhead, 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ x + a ' ≠ []; (s)
| dom vrvHp = dom prvHp, rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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), vtail0 = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ qrl0 ≠ [] ∧ qrl0.last = vhead ∧ phead ≠ vtail0 ∧ unmarkedp(qrl, vs), phead ∈ qrl0 ∨ phead = vtail0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
qrl0.last = vhead, dom vrvHp = dom prvHp, phead ≠ vtail0, qrl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦
Used simplifier rules: ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| qrl0.last = vhead, dom vrvHp = dom prvHp, phead ≠ vtail0, qrl0 ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, vs), markedp(qrl0, ps), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), rvref ∈ prvHp, rvref ∈ vrvHp, phead ∈ vs, phead ∈ ps, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ vhead ∈ (qrl0 + vtail0 ') + qrl from vhead, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ 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 = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ qrl0 ∨ phead = vtail0 ⊦ |
dom vrvHp = dom prvHp, phead ≠ vtail0, qrl0 ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ qrl0.last ∈ (qrl0 + vtail0 ') + qrl from qrl0.last, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦
| dom vrvHp = dom prvHp, phead ≠ vtail0, qrl0 ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(qrl0, vs), nonullRetRefs((qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, rvref ∈ vrvHp, rvref ∈ prvHp, phead ∈ qrl0, ¬ dups(qrl0 + qrl), ¬ dups(qrl0), ¬ dups(qrl), ¬ qrl0.last ∈ (qrl0 + vtail0 ') + qrl from qrl0.last, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ qrl, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vtail1, y
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ prvHpRely(vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]]), 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ prvHpRely(vrvHp, prvHp, prvHp0) ↔ (∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref])
dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, 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), ∃ rvref0. ¬(rvref0 ∈ prvHp → prvHp[rvref, vrvHp[rvref]][rvref0] = prvHp[rvref0] ∨ prvHp[rvref, vrvHp[rvref]][rvref0] = vrvHp[rvref0]), 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[qrl.last].next = null ⊦
Used terms: vrvHp, prvHp, prvHp[rvref, vrvHp[rvref]]
| ⊦ prvHpRely(vrvHp, prvHp, prvHp0) ↔ (∀ rvref. rvref ∈ prvHp → prvHp0[rvref] = prvHp[rvref] ∨ prvHp0[rvref] = vrvHp[rvref]) |
| dom vrvHp = dom prvHp, orl ≠ [], rvref ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), rvref ∈ prvHp, rvref ∈ vrvHp, 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), ∃ rvref0. ¬(rvref0 ∈ prvHp → prvHp[rvref, vrvHp[rvref]][rvref0] = prvHp[rvref0] ∨ prvHp[rvref, vrvHp[rvref]][rvref0] = vrvHp[rvref0]), 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[qrl.last].next = null ⊦ |
dom vrvHp = dom prvHp, prvHp[rvref, vrvHp[rvref]][rvref0] ≠ prvHp[rvref0], prvHp[rvref, vrvHp[rvref]][rvref0] ≠ vrvHp[rvref0], orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref0 ∈ prvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| dom vrvHp = dom prvHp, prvHp[rvref, vrvHp[rvref]][rvref0] ≠ prvHp[rvref0], prvHp[rvref, vrvHp[rvref]][rvref0] ≠ vrvHp[rvref0], orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), rvref0 ∈ prvHp, phead ∈ ps, phead ∈ vs, phead ∈ orl, rvref ∈ vrvHp, rvref ∈ prvHp, ¬ 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, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) Used terms: prvHp, rvref, vrvHp[rvref], rvref0
| ⊦ a ≠ b → st[b, d][a] = st[a] |
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.