| ⊦ ls.tid ≠ tid0 ∧ ( ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ (ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ pre(gs, ls, E11, a) ∧ pcstepf(gs, ls, E11, a) = E12 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns) |
gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E11, a) = E12, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, ls.success, 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), pre(gs, ls, E11, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns)
| gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E11, a) = E12, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, ls.success, 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), pre(gs, ls, E11, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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, E11, a).orl + gstepf(gs, ls, E11, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E11, a).orl) ∧ gstepf(gs, ls, E11, a).vtail ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vtail ∧ gstepf(gs, ls, E11, a).phead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.phead ∧ gstepf(gs, ls, E11, a).vhead ∈ gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E11, a).vs, gstepf(gs, ls, E11, a).ps, gstepf(gs, ls, E11, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E11, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E11, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E11, a).vretRefs, gstepf(gs, ls, E11, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E11, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E11, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E11, a).orl + gstepf(gs, ls, E11, a).qrl, gstepf(gs, ls, E11, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E11, a).vhead, gstepf(gs, ls, E11, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E11, a).owns) |
gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, ls.success, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl) ∧ gs.ps[ls.lst].next = ls.node, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.qrl + rl = (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ gs.vtail ∈ gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') from gs.vtail ∧ gs.vhead ∈ gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node], (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs) ∧ ownsRely(tid0, gs.owns, (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None)))
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 ⊦ (gs.owns:= owns).owns = owns; (s) ⊦ x + a = x + a '; (s) ⊦ gstepf(gs, ls, E11, a) = ( ( gs .ps:= gs.ps [ls.lst, gs.ps[ls.lst].next:= gs.vs[ls.lst].next ]) .qrl:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.qrl ;gs.qrl + gs.vs[ls.lst].next )) .owns:= (gs.ps[ls.lst].next = gs.vs[ls.lst].next ⊃ gs.owns ;gs.owns(ls.node; None) ); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ (gs.ps:= ps).vs = gs.vs; (s) ⊦ (gs.qrl:= qrl).vs = gs.vs; (s) ⊦ (gs.owns:= owns).vs = gs.vs; (s) ⊦ (gs.ps:= ps).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).vhead = gs.vhead; (s) ⊦ (gs.owns:= owns).vhead = gs.vhead; (s) ⊦ (gs.qrl:= qrl).qrl = qrl; (s) ⊦ (gs.owns:= owns).qrl = gs.qrl; (s) ⊦ (gs.ps:= ps).orl = gs.orl; (s) ⊦ (gs.qrl:= qrl).orl = gs.orl; (s) ⊦ (gs.owns:= owns).orl = gs.orl; (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ (gs.ps:= ps).prvHp = gs.prvHp; (s) ⊦ (gs.qrl:= qrl).prvHp = gs.prvHp; (s) ⊦ (gs.owns:= owns).prvHp = gs.prvHp; (s) ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) ⊦ (gs.ps:= ps).vrvHp = gs.vrvHp; (s) ⊦ (gs.qrl:= qrl).vrvHp = gs.vrvHp; (s) ⊦ (gs.owns:= owns).vrvHp = gs.vrvHp; (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ (gs.ps:= ps).vretRefs = gs.vretRefs; (s) ⊦ (gs.qrl:= qrl).vretRefs = gs.vretRefs; (s) ⊦ (gs.owns:= owns).vretRefs = gs.vretRefs; (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ (gs.ps:= ps).rvowns = gs.rvowns; (s) ⊦ (gs.qrl:= qrl).rvowns = gs.rvowns; (s) ⊦ (gs.owns:= owns).rvowns = gs.rvowns; (s) ⊦ (gs.ps:= ps).pretRefs = gs.pretRefs; (s) ⊦ (gs.qrl:= qrl).pretRefs = gs.pretRefs; (s) ⊦ (gs.owns:= owns).pretRefs = gs.pretRefs; (s) ⊦ (gs.ps:= ps).ps = ps; (s) ⊦ (gs.qrl:= qrl).ps = gs.ps; (s) ⊦ (gs.owns:= owns).ps = gs.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.ps:= ps).phead = gs.phead; (s) ⊦ (gs.qrl:= qrl).phead = gs.phead; (s) ⊦ (gs.owns:= owns).phead = gs.phead; (s) ⊦ (gs.ps:= ps).vtail = gs.vtail; (s) ⊦ (gs.qrl:= qrl).vtail = gs.vtail; (s) ⊦ (gs.owns:= owns).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) ⊦ pre(gs, ls, E11, a) ↔ a = (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ doEnq(ls.tid);τ); (s) ⊦ pcstepf(gs, ls, E11, a) = E12; (s)
| gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, ls.success, 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), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl) ∧ gs.ps[ls.lst].next = ls.node, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ (∃ rl. gs.qrl + rl = (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ')) ∧ gs.vtail ∈ gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') from gs.vtail ∧ gs.vhead ∈ gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node ') from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node]) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, gs.vs, gs.ps[ls.lst, gs.ps[ls.lst].next:= ls.node], (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gs.orl + (gs.ps[ls.lst].next = ls.node ⊃ gs.qrl;gs.qrl + ls.node '), gs.vs) ∧ ownsRely(tid0, gs.owns, (gs.ps[ls.lst].next = ls.node ⊃ gs.owns;gs.owns(ls.node; None))) |
vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, ls.tid ≠ tid0, orl ≠ [], ls.success, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), 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, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node ⊦ (∃ rl. qrl + rl = (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ vtail ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vtail ∧ vhead ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs) ∧ ownsRely(tid0, owns, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None)))
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
| vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), ls.node ≠ null, ls.tid ≠ tid0, orl ≠ [], ls.success, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), 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, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node ⊦ (∃ rl. qrl + rl = (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ vtail ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vtail ∧ vhead ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs) ∧ ownsRely(tid0, owns, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) |
vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, ls.node ≠ null, ls.tid ≠ tid0, orl ≠ [], ls.success, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, 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) ⊦ (∃ rl. qrl + rl = (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ vtail ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vtail ∧ vhead ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs) ∧ ownsRely(tid0, owns, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None)))
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
| vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, ls.node ≠ null, ls.tid ≠ tid0, orl ≠ [], ls.success, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, 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) ⊦ (∃ rl. qrl + rl = (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ')) ∧ vtail ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vtail ∧ vhead ∈ orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[ls.lst, ps[ls.lst].next:= ls.node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[ls.lst, ps[ls.lst].next:= ls.node], (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[ls.lst].next = ls.node ⊃ qrl;qrl + ls.node '), vs) ∧ ownsRely(tid0, owns, (ps[ls.lst].next = ls.node ⊃ owns;owns(ls.node; None))) |
vs[lst].next = node, vs[node].val = value, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), success, node ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ node ⊃ oneweakowns(tid, node, owns, vs, ps);noowns(tid, owns)), 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, lst = vtail ∧ ps[lst].next = null ∧ owns(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = node ⊦ (∃ rl. qrl + rl = (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ vtail ∈ orl + (ps[lst].next = node ⊃ qrl;qrl + node ') from vtail ∧ vhead ∈ orl + (ps[lst].next = node ⊃ qrl;qrl + node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= node], (ps[lst].next = node ⊃ owns;owns(node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = node ⊃ owns;owns(node; None)))
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, optval, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval
| vs[lst].next = node, vs[node].val = value, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), success, node ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ node ⊃ oneweakowns(tid, node, owns, vs, ps);noowns(tid, owns)), 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, lst = vtail ∧ ps[lst].next = null ∧ owns(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = node ⊦ (∃ rl. qrl + rl = (ps[lst].next = node ⊃ qrl;qrl + node ')) ∧ vtail ∈ orl + (ps[lst].next = node ⊃ qrl;qrl + node ') from vtail ∧ vhead ∈ orl + (ps[lst].next = node ⊃ qrl;qrl + node ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= node]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= node], (ps[lst].next = node ⊃ owns;owns(node; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = node ⊃ qrl;qrl + node '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = node ⊃ owns;owns(node; None))) |
dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
| dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
dom vrvHp = dom prvHp, ps[lst].next ≠ vs[lst].next, vs[lst].next ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None)))
Used formulas: ps[lst].next = vs[lst].next
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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 ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns)
Used simplifier rules: ⊦ ownsRely(tid, owns, owns); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x = x + y ↔ y = []; (s)
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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 ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns) |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, vs[lst].next ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ 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), lst = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null ∧ owns(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
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, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (orl + qrl.butlast).last ≠ qrl.last, vs[lst].next ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ 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), lst = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null ∧ owns(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
vs[qrl.last].deqID = None, ps[lst].next = vs[lst].next, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[lst].next ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), lst = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null ∧ owns(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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, tail
| vs[qrl.last].deqID = None, ps[lst].next = vs[lst].next, vs[qrl.last].next = null, dom vrvHp = dom prvHp, qrl = phead0 + orl0, (orl + qrl.butlast).last ≠ qrl.last, vs[lst].next ≠ null, orl ≠ [], qrl ≠ [], 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), lst = (orl + qrl.butlast).last ∧ ps[(orl + qrl.butlast).last].next = null ∧ owns(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), lst = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0 ⊦
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] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (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[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), lst = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0 ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[lst].next = vs[lst].next, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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), lst = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[lst].next = vs[lst].next, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (orl + phead0 ' + 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), lst = (orl + phead0 ' + orl0.butlast).last ∧ ps[(orl + phead0 ' + orl0.butlast).last].next = null ∧ owns(vs[(orl + phead0 ' + orl0.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[lst].next = vs[lst].next, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], (orl + (phead0 ' + orl0).butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + phead0 ' + orl0 from (orl + (phead0 ' + 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), lst = (orl + (phead0 ' + orl0).butlast).last ∧ ps[(orl + (phead0 ' + orl0).butlast).last].next = null ∧ owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, orl.last ≠ phead0, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last, lst = orl.last ∧ ps[orl.last].next = null ∧ owns(vs[orl.last].next) = Weak(tid) ∨ lst ∈ orl ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, orl.last ≠ phead0, vs[lst].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last, lst = orl.last ∧ ps[orl.last].next = null ∧ owns(vs[orl.last].next) = Weak(tid) ∨ lst ∈ orl ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (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: orl, vhead0, y
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[lst].next = vs[lst].next, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, (orl + phead0 ' + orl0.butlast).last ≠ (phead0 ' + orl0).last, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (orl + phead0 ' + 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), lst = (orl + phead0 ' + orl0.butlast).last ∧ ps[(orl + phead0 ' + orl0.butlast).last].next = null ∧ owns(vs[(orl + phead0 ' + orl0.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (phead0 ' + orl0.butlast).last ≠ orl0.last, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), lst = (phead0 ' + orl0.butlast).last ∧ ps[(phead0 ' + orl0.butlast).last].next = null ∧ owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (phead0 ' + orl0.butlast).last ≠ orl0.last, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 from (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), lst = (phead0 ' + orl0.butlast).last ∧ ps[(phead0 ' + orl0.butlast).last].next = null ∧ owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0 ⊦ |
vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[lst].next = vs[lst].next, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', (phead0 ' + orl1).last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl1).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), lst = (phead0 ' + orl1).last ∧ ps[(phead0 ' + orl1).last].next = null ∧ owns(vs[(phead0 ' + orl1).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[lst].next = vs[lst].next, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', (phead0 ' + orl1).last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 from (phead0 ' + orl1).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), lst = (phead0 ' + orl1).last ∧ ps[(phead0 ' + orl1).last].next = null ∧ owns(vs[(phead0 ' + orl1).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (phead0 ' + orl1).last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl1 + vhead0 ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs), lst = (phead0 ' + orl1).last ∧ ps[(phead0 ' + orl1).last].next = null ∧ owns(vs[(phead0 ' + orl1).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl1 ⊦
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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, (phead0 ' + orl1).last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl1 + vhead0 ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs), lst = (phead0 ' + orl1).last ∧ ps[(phead0 ' + orl1).last].next = null ∧ owns(vs[(phead0 ' + orl1).last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl1 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[lst].next = vs[lst].next, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1.last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + orl1 + vhead0 ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), lst = orl1.last ∧ ps[orl1.last].next = null ∧ owns(vs[orl1.last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
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) ⊦ 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: phead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[lst].next = vs[lst].next, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1.last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + orl1 + vhead0 ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), lst = orl1.last ∧ ps[orl1.last].next = null ∧ owns(vs[orl1.last].next) = Weak(tid) ∨ lst ∈ orl ∨ lst = phead0 ∨ lst ∈ orl1, orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
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: orl1, lst0, y
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl, vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vtail0, y
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦
Used terms: ps, orl + qrl, ps[lst, ps[lst].next:= vs[lst].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[lst, ps[lst].next:= vs[lst].next][r].val ∧ (ps[r].deqID ≠ None → ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], owns), 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, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦
Used terms: ps, ps[lst, ps[lst].next:= vs[lst].next], tid0, owns, vs, owns, vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None) → r ∈ vs ∧ r ∈ ps[lst, ps[lst].next:= vs[lst].next] ∧ vs[r] = vs[r] ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ owns(r) = owns(r)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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) ⊦ |
ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| ps[lst].next = vs[lst].next, dom vrvHp = dom prvHp, vs[lst].next ≠ null, 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 ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[lst, ps[lst].next:= vs[lst].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ qrl, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(r) ≠ None ⊦ (ps[lst, ps[lst].next:= vs[lst].next][r].deqID = ps[r].deqID ∨ ps[lst, ps[lst].next:= vs[lst].next][r].deqID = vs[r].deqID) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].val = ps[r].val ∨ ps[lst, ps[lst].next:= vs[lst].next][r].val = vs[r].val) ∧ (ps[lst, ps[lst].next:= vs[lst].next][r].next = ps[r].next ∨ ps[lst, ps[lst].next:= vs[lst].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s) ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) Used terms: ps, lst, ps[lst].next:= vs[lst].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| dom vrvHp = dom prvHp, ps[lst].next ≠ vs[lst].next, vs[lst].next ≠ null, 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), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, 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 ⊦ (∃ rl. qrl + rl = (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ')) ∧ vtail ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vtail ∧ vhead ∈ orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next ') from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[lst, ps[lst].next:= vs[lst].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[lst, ps[lst].next:= vs[lst].next], (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) ∧ noidRely(tid0, orl + qrl, vs, orl + (ps[lst].next = vs[lst].next ⊃ qrl;qrl + vs[lst].next '), vs) ∧ ownsRely(tid0, owns, (ps[lst].next = vs[lst].next ⊃ owns;owns(vs[lst].next; None))) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), 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 + vs[vtail].next ' from vtail ∧ vhead ∈ orl + qrl + vs[vtail].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[vtail].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vtail].next; None))
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), 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 + vs[vtail].next ' from vtail ∧ vhead ∈ orl + qrl + vs[vtail].next ' from vhead ∧ equalrl(orl + qrl, vs, ps, vs, ps[vtail, ps[vtail].next:= vs[vtail].next]) ∧ equalowns(vs, ps, owns, tid0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)) ∧ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[vtail].next ', vs) ∧ ownsRely(tid0, owns, owns(vs[vtail].next; None)) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), 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 ⊦
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl + vs[vtail].next ' 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), 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 ⊦
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[vtail, ps[vtail].next:= vs[vtail].next]), 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 ⊦
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)), 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 ⊦
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[vtail].next ', vs), 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 ⊦
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ownsRely(tid0, owns, owns(vs[vtail].next; None)), 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 ⊦
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), 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 ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), 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, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ
| vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), qrl = [], vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦
Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), qrl = [], vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl).last ∈ orl + qrl + vs[(orl + qrl).last].next ' from (orl + qrl).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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.last ∈ orl + vs[orl.last].next ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ [] + x = x; (s) ⊦ ¬ dups([]); (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s)
| vs[vs[orl.last].next].deqID = None, vs[vs[orl.last].next].next = null, ps[vs[orl.last].next] = vs[vs[orl.last].next], dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl, vhead, vs), nonullRetRefs(orl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[orl.last].next ∈ ps, vs[orl.last].next ∈ vs, ¬ dups(orl), ¬ orl.last ∈ orl + vs[orl.last].next ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
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 ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ 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: orl, phead0, y
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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 ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ |
vs[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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[vs[qrl.last].next].deqID = None, ps[qrl.last].next = null, vs[vs[qrl.last].next].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[qrl.last].next ∈ ps, vs[qrl.last].next ∈ vs, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), qrl = phead0 + orl0, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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, tail
| vs[vs[qrl.last].next].deqID = None, vs[vs[qrl.last].next].next = null, ps[qrl.last].next = null, ps[vs[qrl.last].next] = vs[vs[qrl.last].next], dom vrvHp = dom prvHp, owns(vs[qrl.last].next) = Weak(tid), qrl = phead0 + orl0, vs[qrl.last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[qrl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), vs[qrl.last].next ∈ vs, vs[qrl.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ qrl.last ∈ orl + qrl + vs[qrl.last].next ' from qrl.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[vs[(phead0 ' + orl0).last].next].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(phead0 ' + orl0).last].next ∈ ps, vs[(phead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0).last ∈ orl + (phead0 ' + orl0) + vs[(phead0 ' + orl0).last].next ' from (phead0 ' + orl0).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[phead0].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[vs[(phead0 ' + orl0).last].next].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vs[(phead0 ' + orl0).last].next].next = null, ps[vs[(phead0 ' + orl0).last].next] = vs[vs[(phead0 ' + orl0).last].next], dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[(phead0 ' + orl0).last].next ∈ ps, vs[(phead0 ' + orl0).last].next ∈ vs, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0).last ∈ orl + (phead0 ' + orl0) + vs[(phead0 ' + orl0).last].next ' from (phead0 ' + orl0).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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[orl0.last].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, owns(vs[orl0.last].next) = Weak(tid), vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl0.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ orl0.last ∈ orl + (phead0 ' + orl0) + vs[orl0.last].next ' from orl0.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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (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: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[orl0.last].next].deqID = None, vs[vs[orl0.last].next].next = null, ps[orl0.last].next = null, ps[vs[orl0.last].next] = vs[vs[orl0.last].next], dom vrvHp = dom prvHp, owns(vs[orl0.last].next) = Weak(tid), vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl0.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), vs[orl0.last].next ∈ vs, vs[orl0.last].next ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ orl0.last ∈ orl + (phead0 ' + orl0) + vs[orl0.last].next ' from orl0.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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (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: orl0, vhead0, y
| vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vtail ∈ orl + qrl + vs[vtail].next ' 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), 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, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl + vs[(orl + qrl.butlast).last].next ' 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, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl + vs[(orl + qrl.butlast).last].next ' 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, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = phead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl + vs[(orl + qrl.butlast).last].next ' 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, tail
| vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = phead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (orl + qrl.butlast).last ∈ orl + qrl + vs[(orl + qrl.butlast).last].next ' 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[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].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[(phead0 ' + orl0).last].deqID = None, ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[phead0].deqID = None, vs[orl0.last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' + vs[orl.last].next ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ orl.last ∈ orl + phead0 ' + vs[orl.last].next ' from 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (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: orl, vhead0, y
| ps[phead0].deqID = None, vs[orl0.last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (orl + (phead0 ' + orl0).butlast).last ∈ orl + (phead0 ' + orl0) + vs[(orl + (phead0 ' + orl0).butlast).last].next ' from (orl + (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[orl0.last].deqID = None, ps[phead0].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ' from (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| vs[orl0.last].deqID = None, ps[phead0].deqID = None, vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl0.butlast).last ∈ orl + phead0 ' + orl0 + vs[(phead0 ' + orl0.butlast).last].next ' from (phead0 ' + 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ' from (phead0 ' + orl1).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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl0, ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + orl0 + vs[(phead0 ' + orl1).last].next ' from (phead0 ' + orl1).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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, 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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ (phead0 ' + orl1).last ∈ orl + phead0 ' + (orl1 + vhead0 ') + vs[(phead0 ' + orl1).last].next ' from (phead0 ' + orl1).last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
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) ⊦ 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: phead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ null, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ orl1.last ∈ orl + phead0 ' + (orl1 + vhead0 ') + vs[orl1.last].next ' from orl1.last, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
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: orl1, phead1, y
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl + qrl + vs[vtail].next ' 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), 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 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[vtail].next ' 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) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl + vs[vtail].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ orl + qrl + vs[vtail].next ' 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) ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[vtail].next ' 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), 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 simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[vtail].next ' 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), 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 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[vtail].next ' 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) ⊦
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, vs[vtail].next ', vhead
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ qrl + vs[vtail].next ' 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) ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[vtail].next = vhead ⊃ vs[vtail].next ';[]), 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 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ orl, ¬ vhead ∈ (vs[vtail].next = vhead ⊃ vs[vtail].next ';[]), 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 ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ vhead, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ [], ¬ vhead ∈ qrl, ¬ vhead ∈ 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), 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) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ vhead, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ [], ¬ vhead ∈ qrl, ¬ vhead ∈ 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), 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) ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ vhead, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ 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), 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 simplifier rules: ⊦ ¬ a ∈ []; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ vhead, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ vhead ∈ qrl, ¬ vhead ∈ 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), 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 simplifier rules: ⊦ x + a ' ≠ []; (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) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, phead0, y
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalrl(orl + qrl, vs, ps, vs, ps[vtail, ps[vtail].next:= vs[vtail].next]), 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 ⊦ |
⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[vtail, ps[vtail].next:= vs[vtail].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].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) ⊦
Used terms: ps, orl + qrl, ps[vtail, ps[vtail].next:= vs[vtail].next], vs, vs
| ⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)) |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬ ( r ∈ orl + qrl → vs[r].val = vs[r].val ∧ ps[r].val = ps[vtail, ps[vtail].next:= vs[vtail].next][r].val ∧ (vs[r].deqID ≠ None → vs[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].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) ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), 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, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[vtail, ps[vtail].next:= vs[vtail].next][r].val ∧ (ps[r].deqID ≠ None → ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, 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), 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, r ∈ orl ∨ r ∈ qrl ⊦ ps[r].val = ps[vtail, ps[vtail].next:= vs[vtail].next][r].val ∧ (ps[r].deqID ≠ None → ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID) ∧ (ps[r].next ≠ null → ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
Used simplifier rules: ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: ps, vtail, ps[vtail].next:= vs[vtail].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ equalowns(vs, ps, owns, tid0, vs, ps[vtail, ps[vtail].next:= vs[vtail].next], owns(vs[vtail].next; None)), 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 ⊦ |
⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[vtail].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[r] = vs[r] ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ owns(vs[vtail].next; None)(r) = owns(r)), 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) ⊦
Used terms: ps, ps[vtail, ps[vtail].next:= vs[vtail].next], tid0, owns, vs, owns(vs[vtail].next; None), vs
| ⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)) |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬ ( r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ owns(vs[vtail].next; None)(r) ≠ None) → r ∈ vs ∧ r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next] ∧ vs[r] = vs[r] ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ owns(vs[vtail].next; None)(r) = owns(r)), 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) ⊦ |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[b, d] ↔ a = b ∨ a ∈ st; (ws)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), listp(orl + qrl, vs, ps, owns) ∧ vtail ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns)), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used terms: ps, orl + qrl, owns, vtail, vs
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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), listp(orl + qrl, vs, ps, owns) ∧ vtail ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns)), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vtail ∈ orl ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vtail ∈ orl ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used formulas: vtail ∈ orl ∨ vtail ∈ qrl
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), vtail ∈ orl ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
orl + qrl = rl1 + vtail ' + rl2, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(vtail ' + rl2, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ∨ vtail ∈ qrl, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
| orl + qrl = rl1 + vtail ' + rl2, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), listp(vtail ' + rl2, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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 ∨ vtail ∈ qrl, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
orl + qrl = rl1 + vtail ' + rl2, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), rl2 = [], vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail ' + rl2, vs, ps, owns), 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]
| orl + qrl = rl1 + vtail ' + rl2, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), rl2 = [], vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail ' + rl2, vs, ps, owns), 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s)
| orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
⊦ a ≠ b → st[b, d][a] = st[a]
orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vs[vtail].next ≠ null, orl ≠ [], r ≠ vtail, tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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 ∨ vtail ∈ qrl, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next)
Used simplifier rules: ⊦ a ∈ st[a, d]; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ None ≠ Some(tid); (s) Used terms: ps, vtail, ps[vtail].next:= vs[vtail].next, r
| ⊦ a ≠ b → st[b, d][a] = st[a] |
| orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vs[vtail].next ≠ null, orl ≠ [], r ≠ vtail, tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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 ∨ vtail ∈ qrl, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[r].deqID = ps[r].deqID ∨ ps[r].deqID = vs[r].deqID) ∧ (ps[r].val = ps[r].val ∨ ps[r].val = vs[r].val) ∧ (ps[r].next = ps[r].next ∨ ps[r].next = vs[r].next) |
orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, (vs[vtail].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ vtail, tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦
Used simplifier rules: ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)
| orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, ps[vtail].val = vs[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, (vs[vtail].next = r ⊃ None;owns(r)) ≠ owns(r), orl ≠ [], r ≠ vtail, tid ≠ tid0, vtail ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, r ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ weak?(vs[vtail].deqID), 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), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), vtail ∈ orl ∨ vtail ∈ qrl ⊦ |
Used simplifier rules: ⊦ Some(tid) ≠ Weak(tid0); (s)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vtail ∈ orl ∨ vtail ∈ qrl → orl + qrl = rl1 + vtail ' + rl2 ∧ listp(vtail ' + rl2, vs, ps, owns), 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, owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)), 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[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next)
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl).last, vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ weak?(Weak(tid)); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ
| vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null, 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), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next], vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = ps[r].val ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = ps[r].next ∨ ps[(orl + qrl).last, ps[(orl + qrl).last].next:= vs[(orl + qrl).last].next][r].next = vs[r].next) |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl
| ⊦ y ≠ [] → (x + y).last = y.last |
| vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[vtail, ps[vtail].next:= vs[vtail].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vtail ∈ orl, ¬ vtail ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[vtail].next ≠ r → None = owns(r)) ⊦ (vs[vtail].next = r ⊃ None;owns(r)) = owns(r) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = ps[r].deqID ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].deqID = vs[r].deqID) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = ps[r].val ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].val = vs[r].val) ∧ (ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = ps[r].next ∨ ps[vtail, ps[vtail].next:= vs[vtail].next][r].next = vs[r].next) |
vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl.butlast).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = vs[r].next)
| vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl.butlast).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (vs[(orl + qrl.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = vs[r].next) |
vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = r0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail
| vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = r0 + orl0, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ 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 ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + qrl.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + qrl.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + qrl.butlast).last, ps[(orl + qrl.butlast).last].next:= vs[(orl + qrl.butlast).last].next][r].next = vs[r].next) |
vs[(r0 ' + orl0).last].deqID = None, ps[r0].deqID = None, vs[(r0 ' + orl0).last].next = null, ps[(orl + (r0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (r0 ' + orl0).butlast).last].next) = Weak(tid), (orl + (r0 ' + orl0).butlast).last ≠ r0, vs[(orl + (r0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (r0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next], ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (orl + (r0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (r0 ' + orl0).butlast).last ∈ orl0, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + (r0 ' + orl0).butlast).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (vs[(orl + (r0 ' + orl0).butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].val = ps[r].val ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].next = ps[r].next ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].next = vs[r].next)
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] ⊦ a + x = a ' + x; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| vs[(r0 ' + orl0).last].deqID = None, ps[r0].deqID = None, vs[(r0 ' + orl0).last].next = null, ps[(orl + (r0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (r0 ' + orl0).butlast).last].next) = Weak(tid), (orl + (r0 ' + orl0).butlast).last ≠ r0, vs[(orl + (r0 ' + orl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (r0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next], ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (orl + (r0 ' + orl0).butlast).last ∈ orl, ¬ (orl + (r0 ' + orl0).butlast).last ∈ orl0, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + (r0 ' + orl0).butlast).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (vs[(orl + (r0 ' + orl0).butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].val = ps[r].val ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].next = ps[r].next ∨ ps[(orl + (r0 ' + orl0).butlast).last, ps[(orl + (r0 ' + orl0).butlast).last].next:= vs[(orl + (r0 ' + orl0).butlast).last].next][r].next = vs[r].next) |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[r0].deqID = None, vs[(r0 ' + orl0).last].deqID = None, ps[(orl + r0 ' + orl0.butlast).last].next = null, vs[(r0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + r0 ' + orl0.butlast).last].next) = Weak(tid), (orl + r0 ' + orl0.butlast).last ≠ r0, vs[(orl + r0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + r0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (orl + r0 ' + orl0.butlast).last ∈ orl, ¬ (orl + r0 ' + orl0.butlast).last ∈ orl0, 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[r0].deqID = None ∧ unmarkedp(orl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + r0 ' + orl0.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + r0 ' + orl0.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].next = vs[r].next)
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: r0 ', orl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[r0].deqID = None, vs[(r0 ' + orl0).last].deqID = None, ps[(orl + r0 ' + orl0.butlast).last].next = null, vs[(r0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + r0 ' + orl0.butlast).last].next) = Weak(tid), (orl + r0 ' + orl0.butlast).last ≠ r0, vs[(orl + r0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + r0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (orl + r0 ' + orl0.butlast).last ∈ orl, ¬ (orl + r0 ' + orl0.butlast).last ∈ orl0, 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[r0].deqID = None ∧ unmarkedp(orl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(orl + r0 ' + orl0.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(orl + r0 ' + orl0.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].val = ps[r].val ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].next = ps[r].next ∨ ps[(orl + r0 ' + orl0.butlast).last, ps[(orl + r0 ' + orl0.butlast).last].next:= vs[(orl + r0 ' + orl0.butlast).last].next][r].next = vs[r].next) |
ps[r0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[(r0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(r0 ' + orl0.butlast).last].next) = Weak(tid), (r0 ' + orl0.butlast).last ≠ r0, vs[(r0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next], ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (r0 ' + orl0.butlast).last ∈ orl, ¬ (r0 ' + orl0.butlast).last ∈ orl0, 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[r0].deqID = None ∧ unmarkedp(orl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl0.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(r0 ' + orl0.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].next = vs[r].next)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[r0].deqID = None, vs[orl0.last].deqID = None, vs[orl0.last].next = null, ps[(r0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(r0 ' + orl0.butlast).last].next) = Weak(tid), (r0 ' + orl0.butlast).last ≠ r0, vs[(r0 ' + orl0.butlast).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next], ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (r0 ' + orl0.butlast).last ∈ orl, ¬ (r0 ' + orl0.butlast).last ∈ orl0, 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[r0].deqID = None ∧ unmarkedp(orl0, vs), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl0.butlast).last].next ≠ r → None = owns(r)) ⊦ (vs[(r0 ' + orl0.butlast).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl0.butlast).last, ps[(r0 ' + orl0.butlast).last].next:= vs[(r0 ' + orl0.butlast).last].next][r].next = vs[r].next) |
vs[phead0].deqID = None, ps[r0].deqID = None, ps[(r0 ' + orl1).last].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', owns(vs[(r0 ' + orl1).last].next) = Weak(tid), (r0 ' + orl1).last ≠ r0, vs[(r0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (r0 ' + orl1).last ∈ orl, ¬ (r0 ' + orl1).last ∈ orl0, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl1).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (vs[(r0 ' + orl1).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = vs[r].next)
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead0, y
| vs[phead0].deqID = None, ps[r0].deqID = None, ps[(r0 ' + orl1).last].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + phead0 ', owns(vs[(r0 ' + orl1).last].next) = Weak(tid), (r0 ' + orl1).last ≠ r0, vs[(r0 ' + orl1).last].next ≠ null, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + r0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl0, vhead, vs), nonullRetRefs(orl + r0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next], r ∈ vs, r ∈ ps, phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl0, ¬ r0 ∈ orl, ¬ (r0 ' + orl1).last ∈ orl, ¬ (r0 ' + orl1).last ∈ orl0, 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl1).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ (vs[(r0 ' + orl1).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = vs[r].next) |
ps[r0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, ps[(r0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(r0 ' + orl1).last].next) = Weak(tid), (r0 ' + orl1).last ≠ r0, vs[(r0 ' + orl1).last].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + r0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ r0 ∈ orl1, ¬ r0 ∈ orl, ¬ (r0 ' + orl1).last ∈ orl, ¬ (r0 ' + orl1).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl1).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ (vs[(r0 ' + orl1).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = vs[r].next)
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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[r0].deqID = None, vs[phead0].deqID = None, ps[phead0].deqID = None, vs[phead0].next = null, ps[(r0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(r0 ' + orl1).last].next) = Weak(tid), (r0 ' + orl1).last ≠ r0, vs[(r0 ' + orl1).last].next ≠ null, orl ≠ [], r0 ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + r0 ' + orl1 + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + r0 ' + orl1 + phead0 ', vhead, vs), nonullRetRefs(orl + r0 ' + orl1 + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(r0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ ps, r ∈ vs, r ∈ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next], ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ phead0 ∈ orl, ¬ phead0 ∈ orl1, ¬ r0 ∈ orl1, ¬ r0 ∈ orl, ¬ (r0 ' + orl1).last ∈ orl, ¬ (r0 ' + orl1).last ∈ 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), owns(r) = Some(tid0) ∨ owns(r) = Weak(tid0) ∧ ¬(vs[(r0 ' + orl1).last].next ≠ r → None = owns(r)), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[r0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ (vs[(r0 ' + orl1).last].next = r ⊃ None;owns(r)) = owns(r) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = ps[r].deqID ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].deqID = vs[r].deqID) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = ps[r].val ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].val = vs[r].val) ∧ ( ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = ps[r].next ∨ ps[(r0 ' + orl1).last, ps[(r0 ' + orl1).last].next:= vs[(r0 ' + orl1).last].next][r].next = vs[r].next) |
⊦ y ≠ [] → (x + y).last = y.last
Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: r0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ noidRely(tid0, orl + qrl, vs, orl + qrl + vs[vtail].next ', vs), 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 ⊦ |
⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0))
ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[vtail].next ', r, vs)), 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) ⊦
Used terms: orl + qrl, tid0, vs, orl + qrl + vs[vtail].next ', vs
| ⊦ noidRely(tid, rl, vs, rl0, vs0) ↔ (∀ r. noid(tid, rl, r, vs) → noid(tid, rl0, r, vs0)) |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, 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), ∃ r. ¬(noid(tid0, orl + qrl, r, vs) → noid(tid0, orl + qrl + vs[vtail].next ', r, vs)), 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[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ orl + qrl + vs[vtail].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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 ⊦
Used simplifier rules: ⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))); (ss)
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ orl + qrl + vs[vtail].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl + vs[vtail].next ' from r, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, 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[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ (orl from r) + qrl + vs[vtail].next ', phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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) ⊦
Used terms: orl, qrl + vs[vtail].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ orl + qrl + vs[vtail].next ' from r, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ orl + qrl from r, 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[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ qrl + vs[vtail].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ qrl + vs[vtail].next ' from r, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ qrl + vs[vtail].next ' from r, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ (qrl from r) + vs[vtail].next ', phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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) ⊦
Used terms: qrl, vs[vtail].next ', r
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ qrl + vs[vtail].next ' from r, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ (vs[vtail].next = r ⊃ vs[vtail].next ';[]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ 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), 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 simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r0 ∈ (vs[vtail].next = r ⊃ vs[vtail].next ';[]), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ qrl, ¬ r ∈ 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), 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 simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ (qrl from r) + vs[vtail].next ', phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r ∈ orl, ¬ r0 ∈ qrl from r, 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[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl from r, ¬ r ∈ 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), 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) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ qrl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl from r, ¬ r ∈ 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), 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[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), qrl = phead0 + qrl0, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ qrl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl from r, ¬ r ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, 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 simplifier rules: ⊦ ¬ a ∈ []; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, phead0, y
| vs[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), qrl = phead0 + qrl0, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ qrl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl from r, ¬ r ∈ 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), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl0, 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 ⊦ |
vs[vs[vtail].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, vtail = (phead0 ' + qrl0).last ∨ vtail = (orl + (phead0 ' + qrl0).butlast).last ∧ vs[(phead0 ' + qrl0).last].deqID = None ∧ vs[(phead0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, 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) ⊦ a ' + x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s)
| vs[vs[vtail].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, vtail = (phead0 ' + qrl0).last ∨ vtail = (orl + (phead0 ' + qrl0).butlast).last ∧ vs[(phead0 ' + qrl0).last].deqID = None ∧ vs[(phead0 ' + qrl0).last].next = null, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (phead0 ' + qrl0).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
ps[phead0].deqID = None, vs[vs[vtail].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[vtail].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + (phead0 ' + qrl0).butlast).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
| ps[phead0].deqID = None, vs[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (phead0 ' + qrl0).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
vs[vs[(phead0 ' + qrl0).last].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0).last].next) = Weak(tid), vs[(phead0 ' + qrl0).last].next ≠ r, vs[(phead0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
| vs[vs[(phead0 ' + qrl0).last].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0).last].next) = Weak(tid), vs[(phead0 ' + qrl0).last].next ≠ r, vs[(phead0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, vs[vs[(phead0 ' + qrl0).last].next].deqID = Some(tid0), ps[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0).last].next) = Weak(tid), qrl0 = [], vs[(phead0 ' + qrl0).last].next ≠ r, vs[(phead0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
ps[phead0].deqID = None, vs[vs[qrl0.last].next].deqID = Some(tid0), ps[qrl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[qrl0.last].next) = Weak(tid), vs[qrl0.last].next ≠ r, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl0.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[qrl0.last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
Used terms: phead0 ', qrl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[(phead0 ' + qrl0).last].next].deqID = Some(tid0), ps[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0).last].next) = Weak(tid), qrl0 = [], vs[(phead0 ' + qrl0).last].next ≠ r, vs[(phead0 ' + qrl0).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ a ∈ []; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ dups([]); (s)
| vs[vs[phead0].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' ≠ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) Used terms: ps, orl, owns, phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[phead0].deqID = None, vs[vs[qrl0.last].next].deqID = Some(tid0), ps[qrl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[qrl0.last].next) = Weak(tid), vs[qrl0.last].next ≠ r, vs[qrl0.last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[qrl0.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[qrl0.last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
vs[vs[vhead0].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), qrl0 = orl0 + vhead0 ', vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead0, y
| vs[vs[vhead0].next].deqID = Some(tid0), ps[phead0].deqID = None, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), qrl0 = orl0 + vhead0 ', vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), ps[vhead0].deqID = None, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None, r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦
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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), ps[vhead0].deqID = None, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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) ∧ vs[vhead0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[vhead0].deqID = None, r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' ≠ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s) Used terms: ps, orl + phead0 ' + orl0, owns, vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[phead0].deqID = None, vs[vs[vtail].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[vtail].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + (phead0 ' + qrl0).butlast).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[vtail].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
vs[(phead0 ' + qrl0).last].deqID = None, vs[vs[(orl + (phead0 ' + qrl0).butlast).last].next].deqID = Some(tid0), ps[phead0].deqID = None, vs[(phead0 ' + qrl0).last].next = null, ps[(orl + (phead0 ' + qrl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + qrl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + qrl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + qrl0).butlast).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
| vs[(phead0 ' + qrl0).last].deqID = None, vs[vs[(orl + (phead0 ' + qrl0).butlast).last].next].deqID = Some(tid0), ps[phead0].deqID = None, vs[(phead0 ' + qrl0).last].next = null, ps[(orl + (phead0 ' + qrl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + qrl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + qrl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + qrl0).butlast).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + qrl0).butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[(orl + (phead0 ' + qrl0).butlast).last].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + qrl0).butlast).last].next) = Weak(tid), qrl0 = [], vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + qrl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + qrl0).butlast).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
ps[phead0].deqID = None, vs[vs[(orl + phead0 ' + qrl0.butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[(orl + phead0 ' + qrl0.butlast).last].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + phead0 ' + qrl0.butlast).last].next) = Weak(tid), vs[(orl + phead0 ' + qrl0.butlast).last].next ≠ r, vs[(orl + phead0 ' + qrl0.butlast).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + phead0 ' + qrl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + phead0 ' + qrl0.butlast).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
Used terms: phead0 ', qrl0
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + qrl0).butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[(orl + (phead0 ' + qrl0).butlast).last].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + qrl0).butlast).last].next) = Weak(tid), qrl0 = [], vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + qrl0).butlast).last].next ≠ null, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + qrl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + qrl0).butlast).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
vs[vs[orl.last].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[orl.last].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, vs[orl.last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ a ∈ []; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| vs[vs[orl.last].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[orl.last].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ null, vs[orl.last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), phead ∈ ps, phead ∈ vs, phead ∈ orl, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl), ¬ 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), orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', phead0, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), phead0 ∈ ps, phead0 ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦ |
vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl0 + vhead0 ') + phead0 ', phead0, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, vs), markedp(orl0, ps), nextnottid(tid, vhead, vs), noid(tid0, (orl0 + vhead0 ') + phead0 ', phead0, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vhead0].deqID), some?(ps[vhead0].deqID), phead ∈ ps, phead ∈ vs, phead0 ∈ vs, phead0 ∈ ps, ¬ dups(orl0), ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0, owns, vhead0 ' + phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[phead0].deqID = None, vs[vs[(orl + phead0 ' + qrl0.butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + qrl0).last].deqID = None, ps[(orl + phead0 ' + qrl0.butlast).last].next = null, vs[(phead0 ' + qrl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + phead0 ' + qrl0.butlast).last].next) = Weak(tid), vs[(orl + phead0 ' + qrl0.butlast).last].next ≠ r, vs[(orl + phead0 ' + qrl0.butlast).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + phead0 ' + qrl0.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(orl + phead0 ' + qrl0.butlast).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
ps[phead0].deqID = None, vs[qrl0.last].deqID = None, vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID = Some(tid0), vs[qrl0.last].next = null, ps[(phead0 ' + qrl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + qrl0.butlast).last].next ≠ r, vs[(phead0 ' + qrl0.butlast).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0.butlast).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| ps[phead0].deqID = None, vs[qrl0.last].deqID = None, vs[vs[(phead0 ' + qrl0.butlast).last].next].deqID = Some(tid0), vs[qrl0.last].next = null, ps[(phead0 ' + qrl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + qrl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + qrl0.butlast).last].next ≠ r, vs[(phead0 ' + qrl0.butlast).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + qrl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + qrl0.butlast).last].next ∈ phead0 ' + qrl0 from r, 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), r = phead0 ∨ r ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs) ⊦ |
vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), qrl0 = orl0 + vhead0 ', vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: qrl0, vhead0, y
| vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), qrl0 = orl0 + vhead0 ', vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + qrl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + qrl0, r, vs), noid(tid, orl + phead0 ' + qrl0, vhead, vs), nonullRetRefs(orl + phead0 ' + qrl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + qrl0), ¬ dups(orl), ¬ dups(qrl0), ¬ r ∈ orl, ¬ phead0 ∈ qrl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + qrl0 from r, 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(qrl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(qrl0, vs), r = phead0 ∨ r ∈ qrl0 ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].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 ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦
ps[vhead0].deqID = None, vs[vs[orl0.last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl0.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl0.last].next) = Weak(tid), vs[orl0.last].next ≠ r, vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl0.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[orl0.last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vs[(phead0 ' + orl0).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl0).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(phead0 ' + orl0).last].next) = Weak(tid), vs[(phead0 ' + orl0).last].next ≠ r, vs[(phead0 ' + orl0).last].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0).last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦ |
ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ r, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ phead0 ' + vhead0 ' from r, 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), r = phead0 ∨ r = vhead0, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s)
| ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ r, vs[phead0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ r ∈ orl, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ phead0 ' + vhead0 ' from r, 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), r = phead0 ∨ r = vhead0, orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl, owns, phead0 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[vhead0].deqID = None, vs[vs[orl0.last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl0.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl0.last].next) = Weak(tid), vs[orl0.last].next ≠ r, vs[orl0.last].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl0.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[orl0.last].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0 ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[r0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + r0 ', owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, r0, y
| ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[r0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + r0 ', owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, orl ≠ [], orl0 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl0 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl0 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ phead0 ' + orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ r ∈ orl, ¬ phead0 ∈ orl0, 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), r = phead0 ∨ r ∈ orl0 ∨ r = vhead0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ r0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + (orl1 + r0 ') + vhead0 ', r, vs), noid(tid, orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ r0 ∈ orl, ¬ r0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ phead0 ' + (orl1 + r0 ') + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ r ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[r0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[r0].deqID = None, r = phead0 ∨ r ∈ orl1 ∨ r = r0 ∨ r = vhead0 ⊦
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] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ r0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + (orl1 + r0 ') + vhead0 ', r, vs), noid(tid, orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl1 + r0 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ r0 ∈ orl, ¬ r0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ phead0 ' + (orl1 + r0 ') + vhead0 ' from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ r ∈ orl, ¬ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∧ vs[r0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ∧ vs[r0].deqID = None, r = phead0 ∨ r ∈ orl1 ∨ r = r0 ∨ r = vhead0 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + phead0 ' + orl1, owns, r0 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| vs[r0].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, orl ≠ [], r0 ≠ r, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r0 ∈ (orl from r) + qrl + vs[vtail].next ', phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ r0 ∈ orl + qrl from r, 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[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl, ¬ vs[vtail].next ∈ orl from r, 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) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' ↔ a = b; (s)
| vs[vs[vtail].next].deqID = Some(tid0), ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ r, vs[vtail].next ≠ null, 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl, ¬ vs[vtail].next ∈ orl from r, 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[vs[vtail].next].deqID = Some(tid0), vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl, ¬ vs[vtail].next ∈ orl from r, 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) ⊦
Used simplifier rules: listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ ⊦ None ≠ Some(tid); (s)
| vs[vs[vtail].next].deqID = Some(tid0), vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vtail = (orl + qrl.butlast).last, vs[vtail].next ≠ r, vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[vtail].next ∈ qrl, ¬ vs[vtail].next ∈ orl from r, 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) ⊦ |
vs[qrl.last].deqID = None, vs[vs[(orl + qrl.butlast).last].next].deqID = Some(tid0), vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ r, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[(orl + qrl.butlast).last].next ∈ qrl, ¬ vs[(orl + qrl.butlast).last].next ∈ orl from r, 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[vs[(orl + qrl.butlast).last].next].deqID = Some(tid0), vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vs[(orl + qrl.butlast).last].next ≠ r, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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), noid(tid0, orl + qrl, r, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[(orl + qrl.butlast).last].next ∈ qrl, ¬ vs[(orl + qrl.butlast).last].next ∈ orl from r, 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[vs[(orl + qrl.butlast).last].next].deqID = Some(tid0), vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = phead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ r, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[(orl + qrl.butlast).last].next ∈ qrl, ¬ vs[(orl + qrl.butlast).last].next ∈ orl from r, 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, tail
| vs[vs[(orl + qrl.butlast).last].next].deqID = Some(tid0), vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = phead0 + orl0, vs[(orl + qrl.butlast).last].next ≠ r, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], 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(tid0, orl + qrl, r, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ vs[(orl + qrl.butlast).last].next ∈ qrl, ¬ vs[(orl + qrl.butlast).last].next ∈ orl from r, 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[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].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) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)
| vs[(phead0 ' + orl0).last].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), ps[phead0].deqID = None, vs[(phead0 ' + orl0).last].next = null, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), vs[orl0.last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used terms: phead0 ', orl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), vs[(phead0 ' + orl0).last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[(phead0 ' + orl0).last].next = null, dom vrvHp = dom prvHp, orl0 = [], owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[orl.last].next].deqID = Some(tid0), vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ r, vs[orl.last].next ≠ null, vs[orl.last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vs[orl.last].next ∈ orl from r, 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[orl.last].next].deqID = Some(tid0), vs[phead0].next = null, ps[orl.last].next = null, dom vrvHp = dom prvHp, owns(vs[orl.last].next) = Weak(tid), vs[orl.last].next ≠ r, vs[orl.last].next ≠ null, vs[orl.last].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ', vhead, vs), noid(tid0, orl + phead0 ', r, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl.last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vs[orl.last].next ∈ orl from r, 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ⊦ |
vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ orl from r, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead0, y
| vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].deqID = None, ps[phead0].deqID = None, ps[vhead0].next = null, vs[phead0].next = null, dom vrvHp = dom prvHp, orl = orl0 + vhead0 ', owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, orl ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ', r, vs), noid(tid, orl + phead0 ', vhead, vs), nonullRetRefs(orl + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl), ¬ phead0 ∈ orl, ¬ vs[vhead0].next ∈ orl from r, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0 ⊦ |
ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), noid(tid0, (orl0 + vhead0 ') + phead0 ', r, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ vs[vhead0].next ∈ orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0, r ∈ orl0 ∨ r = vhead0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[phead0].deqID = None, vs[vs[vhead0].next].deqID = Some(tid0), vs[phead0].next = null, ps[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[vhead0].next) = Weak(tid), vs[vhead0].next ≠ r, vs[vhead0].next ≠ null, vs[vhead0].next ≠ phead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((orl0 + vhead0 ') + phead0 ', vs, ps, owns), markedp(orl0, ps), markedp(orl0, vs), nextnottid(tid, vhead, vs), noid(tid, (orl0 + vhead0 ') + phead0 ', vhead, vs), noid(tid0, (orl0 + vhead0 ') + phead0 ', r, vs), nonullRetRefs((orl0 + vhead0 ') + phead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[vhead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vhead0].deqID), some?(vs[vhead0].deqID), r ∈ ps, r ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl0), ¬ vs[vhead0].next ∈ orl0 + vhead0 ' from r, ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, 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), vhead0 = vhead ∨ orl0 ≠ [] ∧ orl0.last = vhead ∧ phead ≠ vhead0, phead ∈ orl0 ∨ phead = vhead0, r ∈ orl0 ∨ r = vhead0 ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl0, owns, vhead0 ' + phead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[phead0].deqID = None, vs[vs[(orl + (phead0 ' + orl0).butlast).last].next].deqID = Some(tid0), vs[orl0.last].deqID = None, ps[(orl + (phead0 ' + orl0).butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp = dom prvHp, owns(vs[(orl + (phead0 ' + orl0).butlast).last].next) = Weak(tid), vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ r, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ null, vs[(orl + (phead0 ' + orl0).butlast).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead0 ' + orl0).butlast).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl0, ¬ vs[(orl + (phead0 ' + orl0).butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = Some(tid0), vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ r, vs[(phead0 ' + orl0.butlast).last].next ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl0, ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| ps[phead0].deqID = None, vs[orl0.last].deqID = None, vs[vs[(phead0 ' + orl0.butlast).last].next].deqID = Some(tid0), vs[orl0.last].next = null, ps[(phead0 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl0.butlast).last].next) = Weak(tid), vs[(phead0 ' + orl0.butlast).last].next ≠ r, vs[(phead0 ' + orl0.butlast).last].next ≠ null, vs[(phead0 ' + orl0.butlast).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl0.butlast).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl0, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl0, ¬ vs[(phead0 ' + orl0.butlast).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ orl0, ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vhead0, y
| vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl0 = orl1 + vhead0 ', owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl0, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl0, r, vs), noid(tid, orl + phead0 ' + orl0, vhead, vs), nonullRetRefs(orl + phead0 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ orl0, ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, 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[phead0].deqID = None ∧ unmarkedp(orl0, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, vs[(phead0 ' + orl1).last].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, 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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[(phead0 ' + orl1).last].next = null, dom vrvHp = dom prvHp, owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, vs[(phead0 ' + orl1).last].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps[vhead0].deqID = None, vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = [], owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, vs[(phead0 ' + orl1).last].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
ps[vhead0].deqID = None, vs[vs[orl1.last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ r, vs[orl1.last].next ≠ null, vs[orl1.last].next ≠ phead0, vs[orl1.last].next ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[orl1.last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[orl1.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used terms: phead0 ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps[vhead0].deqID = None, vs[vs[(phead0 ' + orl1).last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[(phead0 ' + orl1).last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, orl1 = [], owns(vs[(phead0 ' + orl1).last].next) = Weak(tid), vs[(phead0 ' + orl1).last].next ≠ r, vs[(phead0 ' + orl1).last].next ≠ null, vs[(phead0 ' + orl1).last].next ≠ phead0, vs[(phead0 ' + orl1).last].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead0 ' + orl1).last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[(phead0 ' + orl1).last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[(phead0 ' + orl1).last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ r, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl from r, 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ dups([]); (s) ⊦ [] + x = x; (s)
| ps[vhead0].deqID = None, ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[phead0].next].deqID = Some(tid0), vs[vhead0].next = null, ps[phead0].next = null, dom vrvHp = dom prvHp, owns(vs[phead0].next) = Weak(tid), vs[phead0].next ≠ r, vs[phead0].next ≠ null, vs[phead0].next ≠ phead0, vs[phead0].next ≠ vhead0, orl ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[phead0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl), ¬ vhead0 ∈ orl, ¬ phead0 ∈ orl, ¬ vs[phead0].next ∈ orl from r, 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 ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl, owns, phead0 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[vhead0].deqID = None, vs[vs[orl1.last].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[orl1.last].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[orl1.last].next) = Weak(tid), vs[orl1.last].next ≠ r, vs[orl1.last].next ≠ null, vs[orl1.last].next ≠ phead0, vs[orl1.last].next ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[orl1.last].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl1, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[orl1.last].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[orl1.last].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[r0].next = null, dom vrvHp = dom prvHp, orl1 = orl0 + r0 ', owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, vs[r0].next ≠ phead0, vs[r0].next ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[r0].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl1, r0, y
| ps[phead0].deqID = None, vs[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), ps[vhead0].deqID = None, vs[vhead0].next = null, ps[r0].next = null, dom vrvHp = dom prvHp, orl1 = orl0 + r0 ', owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, vs[r0].next ≠ phead0, vs[r0].next ≠ vhead0, orl ≠ [], orl1 ≠ [], phead0 ≠ vhead0, tid ≠ tid0, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + phead0 ' + orl1 + vhead0 ', vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + phead0 ' + orl1 + vhead0 ', vhead, vs), noid(tid0, orl + phead0 ' + orl1 + vhead0 ', r, vs), nonullRetRefs(orl + phead0 ' + orl1 + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(orl1, ps), r ∈ ps, r ∈ vs, phead ∈ orl, phead ∈ vs, phead ∈ ps, r ∈ orl, ¬ dups(orl + orl1), ¬ dups(orl), ¬ dups(orl1), ¬ vs[r0].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl1, ¬ phead0 ∈ orl1, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ 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), orl.last = vhead ∧ unmarkedp(orl1, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl1, vs) ⊦ |
ps[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, vs[r0].next ≠ phead0, vs[r0].next ≠ vhead0, vs[r0].next ≠ r0, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ r0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + (orl0 + r0 ') + vhead0 ', r, vs), noid(tid, orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl, ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ orl0, 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) ∧ vs[r0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[r0].deqID = None ⊦
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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps[vhead0].deqID = None, vs[vs[r0].next].deqID = Some(tid0), vs[vhead0].deqID = None, ps[phead0].deqID = None, ps[r0].deqID = None, ps[r0].next = null, vs[vhead0].next = null, dom vrvHp = dom prvHp, owns(vs[r0].next) = Weak(tid), vs[r0].next ≠ r, vs[r0].next ≠ null, vs[r0].next ≠ phead0, vs[r0].next ≠ vhead0, vs[r0].next ≠ r0, orl ≠ [], phead0 ≠ vhead0, phead0 ≠ r0, tid ≠ tid0, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid0, orl + phead0 ' + (orl0 + r0 ') + vhead0 ', r, vs), noid(tid, orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vhead, vs), nonullRetRefs(orl + phead0 ' + (orl0 + r0 ') + vhead0 ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[r0].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(orl0, ps), r ∈ orl, phead ∈ ps, phead ∈ vs, phead ∈ orl, r ∈ vs, r ∈ ps, ¬ dups(orl + orl0), ¬ dups(orl), ¬ dups(orl0), ¬ r0 ∈ orl, ¬ r0 ∈ orl0, ¬ vs[r0].next ∈ orl from r, ¬ vhead0 ∈ orl, ¬ vhead0 ∈ orl0, ¬ phead0 ∈ orl0, ¬ phead0 ∈ orl, ¬ vs[r0].next ∈ orl0, 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) ∧ vs[r0].deqID = None ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead0].deqID = None ∧ unmarkedp(orl0, vs) ∧ vs[r0].deqID = None ⊦ |
⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])
Used simplifier rules: ⊦ a ' + x ≠ []; (s) ⊦ listp(r ' + r0 ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ r0 ≠ null ∧ owns(r0) = None ∧ r0 ∈ vs ∧ r0 ∈ ps ∧ ¬ weak?(vs[r0].deqID) ∧ (ps[r0].deqID = vs[r0].deqID ∨ ps[r0].deqID = None) ∧ ps[r0].val = vs[r0].val ∧ ps[r0].next = null ∧ ( vs[r0].next ≠ null → vs[r0].next ∈ vs ∧ vs[r0].next ∈ ps ∧ ps[vs[r0].next] = vs[vs[r0].next] ∧ ps[vs[r0].next].deqID = None ∧ ps[vs[r0].next].next = null ∧ weak?(owns(vs[r0].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps, orl + phead0 ' + orl0, owns, r0 ' + vhead0 ', vs
| ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []) |
| ps[vtail].next = null, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vs[vtail].next ≠ null, 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), oneweakowns(tid, vs[vtail].next, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ownsRely(tid0, owns, owns(vs[vtail].next; None)), 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 ⊦ |
⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid)
Used terms: tid0, owns, owns(vs[vtail].next; None)
| ⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid) |
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.