| ⊦ ls.tid ≠ tid0 ∧ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.lst ∈ gs.orl + gs.qrl ∧ ls.nxt = gs.vs[ls.lst].next ∧ ls.nxt = gs.ps[ls.lst].next ∧ ls.nxt ≠ null) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E15, a) ∧ pcstepf(gs, ls, E15, a) = E4 → (∃ rl. gs.orl + gs.qrl + rl = gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns) |
ls.nxt = gs.vs[ls.lst].next, ls.nxt = gs.ps[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E15, a) = E4, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E15, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns)
| ls.nxt = gs.vs[ls.lst].next, ls.nxt = gs.ps[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E15, a) = E4, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E15, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ 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, E15, a).orl + gstepf(gs, ls, E15, a).qrl) ∧ (∃ rl0. gs.orl + rl0 = gstepf(gs, ls, E15, a).orl) ∧ gstepf(gs, ls, E15, a).vtail ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vtail ∧ gstepf(gs, ls, E15, a).phead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.phead ∧ gstepf(gs, ls, E15, a).vhead ∈ gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, tid0, gstepf(gs, ls, E15, a).vs, gstepf(gs, ls, E15, a).ps, gstepf(gs, ls, E15, a).owns) ∧ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).vretRefs(tid0) ∧ (gs.pretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0) ∨ gs.vretRefs(tid0) = gstepf(gs, ls, E15, a).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, gstepf(gs, ls, E15, a).rvowns, gs.vrvHp) ∧ rvrely(tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, gstepf(gs, ls, E15, a).vretRefs, gstepf(gs, ls, E15, a).vrvHp) ∧ dom gs.vrvHp ⊆ dom gstepf(gs, ls, E15, a).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gstepf(gs, ls, E15, a).prvHp) ∧ noidRely(tid0, gs.orl + gs.qrl, gs.vs, gstepf(gs, ls, E15, a).orl + gstepf(gs, ls, E15, a).qrl, gstepf(gs, ls, E15, a).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, gstepf(gs, ls, E15, a).vhead, gstepf(gs, ls, E15, a).vs) ∧ ownsRely(tid0, gs.owns, gstepf(gs, ls, E15, a).owns) |
ls.nxt = gs.vs[ls.lst].next, ls.nxt = gs.ps[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), 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, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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.vtail = (gs.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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(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.orl + gs.qrl + rl = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl) ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.vtail ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.phead ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ gs.vretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0) ∨ gs.vretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ dom gs.prvHp ⊆ dom (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ ownsRely(tid0, gs.owns, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ 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 ⊦ gstepf(gs, ls, E15, a) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, E15, a) ↔ a = τ; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pcstepf(gs, ls, E15, a) = E4; (s)
| ls.nxt = gs.vs[ls.lst].next, ls.nxt = gs.ps[ls.lst].next, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, ls.nxt ≠ null, gs.orl ≠ [], ls.tid ≠ tid0, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), 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, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ 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.vtail = (gs.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, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(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.orl + gs.qrl + rl = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ (∃ rl0. gs.orl + rl0 = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl) ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.vtail ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.phead ∧ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∈ (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ equalowns (gs.vs, gs.ps, gs.owns, tid0, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ gs.vretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs(tid0) ∧ ( gs.pretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0) ∨ gs.vretRefs(tid0) = (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, gs.rvowns, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns, gs.vrvHp) ∧ rvrely (tid0, gs.rvowns, gs.vretRefs, gs.vrvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ dom gs.prvHp ⊆ dom (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, gs.orl + gs.qrl, gs.vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, gs.vhead, gs.vs, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ ownsRely(tid0, gs.owns, (gs.vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) |
ls.nxt = ps[ls.lst].next, ls.nxt = vs[ls.lst].next, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ (∃ rl0. orl + rl0 = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl) ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from vtail ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from phead ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ vretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs(tid0) ∧ (pretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0) ∨ vretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ dom prvHp ⊆ dom (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp ∧ prvHpRely(vrvHp, prvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, vhead, vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ ownsRely(tid0, owns, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs
| ls.nxt = ps[ls.lst].next, ls.nxt = vs[ls.lst].next, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl) ∧ (∃ rl0. orl + rl0 = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl) ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vtail ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from vtail ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).phead ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from phead ∧ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead ∈ (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl from vhead ∧ equalrl(orl + qrl, vs, ps, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).ps, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) ∧ vretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs(tid0) ∧ (pretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0) ∨ vretRefs(tid0) = (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).pretRefs(tid0)) ∧ rvownsrely(tid0, rvowns, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).rvowns, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vretRefs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp) ∧ dom prvHp ⊆ dom (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vrvHp ∧ prvHpRely(vrvHp, prvHp, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).orl + (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).qrl, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ nextnottidRely(tid0, vhead, vs, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vhead, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).vs) ∧ ownsRely(tid0, owns, (vtail = ls.lst ⊃ gs.vtail:= ls.nxt;gs).owns) |
ls.nxt = vs[ls.lst].next, ls.nxt = ps[ls.lst].next, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vtail:= phead4 = mkgs (ps, ps0, phead, phead0, phead4, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)
| ls.nxt = vs[ls.lst].next, ls.nxt = ps[ls.lst].next, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, ls.nxt ≠ null, ls.tid ≠ tid0, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ 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, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = ls.lst ⊃ mkgs(ps, vs, phead, vhead, ls.nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[lst].next, nxt = vs[lst].next, owns(node) = Some(tid), ¬ success, node ≠ null, nxt ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
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
| ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[lst].next, nxt = vs[lst].next, owns(node) = Some(tid), ¬ success, node ≠ null, nxt ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, nxt, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns)
| vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ (∃ rl0. orl + rl0 = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl) ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vtail ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from phead ∧ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∈ (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl from vhead ∧ equalrl (orl + qrl, vs, ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ equalowns (vs, ps, owns, tid0, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (tid0) ∧ ( pretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0) ∨ vretRefs(tid0) = (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs (tid0)) ∧ rvownsrely (tid0, rvowns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns, vrvHp) ∧ rvrely (tid0, rvowns, vretRefs, vrvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ dom prvHp ⊆ dom (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp ∧ prvHpRely (vrvHp, prvHp, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ noidRely (tid0, orl + qrl, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ nextnottidRely (tid0, vhead, vs, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ ownsRely (tid0, owns, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) |
vs[lst].next = ps[lst].next, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, (vtail = lst ⊃ mkgs (ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0
| vs[lst].next = ps[lst].next, (vtail = lst ⊃ mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), ps[lst].next ≠ null, 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), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), vtail = lst, ps[lst].next ≠ null, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), ps[lst].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vtail ≠ lst, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0)
| vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, ps[lst].next, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), vtail = lst, ps[lst].next ≠ null, node ≠ 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ (orl0 from vhead0) + qrl0
Used terms: orl0, qrl0, vhead0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ qrl0 from vhead0
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ qrl0 from vhead0 |
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ qrl0 from vhead0, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs0, ps0, owns0)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used terms: ps0, orl0 + qrl0, owns0, lst, vs0
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs0, ps0, owns0)), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(lst ' + rl2, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), rl2 = lst0 + rl, ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; 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)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), rl2 = lst0 + rl, ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = [], ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = lst0 + rl0, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: reflist freely generated by [], +;;
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = [], ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', ps0[ps0[lst].next].next = null, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ ¬ 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) ⊦ x + [] = x; (s)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', ps0[ps0[lst].next].next = null, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = null, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', vs0[qrl0.last].deqID = None, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = null, vs0[qrl0.last].next = null, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = null, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ', vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = null, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0).last, node ≠ ps0[(orl0 + qrl0).last].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + qrl0).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0).last].next].next)), ps0[(orl0 + qrl0).last].next ∈ orl0 ∨ ps0[(orl0 + qrl0).last].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ', vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = null, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0).last, node ≠ ps0[(orl0 + qrl0).last].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + qrl0).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0).last].next].next)), ps0[(orl0 + qrl0).last].next ∈ orl0 ∨ ps0[(orl0 + qrl0).last].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ', ps0[ps0[(orl0 + qrl0).last].next].next = null, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0).last, node ≠ ps0[(orl0 + qrl0).last].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, vs0[ps0[(orl0 + qrl0).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[(orl0 + qrl0).last].next ∈ orl0 ∨ ps0[(orl0 + qrl0).last].next ∈ qrl0 ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ', ps0[ps0[(orl0 + qrl0).last].next].next = null, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0).last, node ≠ ps0[(orl0 + qrl0).last].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, vs0[ps0[(orl0 + qrl0).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[(orl0 + qrl0).last].next ∈ orl0 ∨ ps0[(orl0 + qrl0).last].next ∈ qrl0 ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ', ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = null, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ phead, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[ps0[(phead ' + rl).last].next].next ≠ null → vs0[ps0[(phead ' + rl).last].next].next ∈ vs0 ∧ vs0[ps0[(phead ' + rl).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next] = vs0[vs0[ps0[(phead ' + rl).last].next].next] ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next].deqID = None ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(phead ' + rl).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[(phead ' + rl).last].next ∈ orl0 ∨ ps0[(phead ' + rl).last].next = phead ∨ ps0[(phead ' + rl).last].next ∈ rl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ 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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws)
| orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ', ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = null, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ phead, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[ps0[(phead ' + rl).last].next].next ≠ null → vs0[ps0[(phead ' + rl).last].next].next ∈ vs0 ∧ vs0[ps0[(phead ' + rl).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next] = vs0[vs0[ps0[(phead ' + rl).last].next].next] ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next].deqID = None ∧ ps0[vs0[ps0[(phead ' + rl).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(phead ' + rl).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[(phead ' + rl).last].next ∈ orl0 ∨ ps0[(phead ' + rl).last].next = phead ∨ ps0[(phead ' + rl).last].next ∈ rl ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ', ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = null, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ phead, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ null, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[rl.last].next].next ≠ null → vs0[ps0[rl.last].next].next ∈ vs0 ∧ vs0[ps0[rl.last].next].next ∈ ps0 ∧ ps0[vs0[ps0[rl.last].next].next] = vs0[vs0[ps0[rl.last].next].next] ∧ ps0[vs0[ps0[rl.last].next].next].deqID = None ∧ ps0[vs0[ps0[rl.last].next].next].next = null ∧ weak?(owns0(vs0[ps0[rl.last].next].next)), ps0[rl.last].next ∈ orl0 ∨ ps0[rl.last].next = phead ∨ ps0[rl.last].next ∈ rl, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦
Used simplifier rules: ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ', ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = null, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ phead, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ null, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[rl.last].next].next ≠ null → vs0[ps0[rl.last].next].next ∈ vs0 ∧ vs0[ps0[rl.last].next].next ∈ ps0 ∧ ps0[vs0[ps0[rl.last].next].next] = vs0[vs0[ps0[rl.last].next].next] ∧ ps0[vs0[ps0[rl.last].next].next].deqID = None ∧ ps0[vs0[ps0[rl.last].next].next].next = null ∧ weak?(owns0(vs0[ps0[rl.last].next].next)), ps0[rl.last].next ∈ orl0 ∨ ps0[rl.last].next = phead ∨ ps0[rl.last].next ∈ rl, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦ |
orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ', ps0[phead].deqID = None, ps0[ps0[rl.last].next].next = null, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[rl.last].val = vs0[rl.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl.last].next) = None, owns0(rl.last) = None, owns0(node) = Some(tid), rl = orl + ps0[rl.last].next ', rl.last ≠ null, ps0[rl.last].next ≠ phead, ps0[rl.last].next ≠ null, node ≠ phead, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ null, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[rl.last].next ∈ rl, ps0[rl.last].next ∈ ps0, ps0[rl.last].next ∈ vs0, rl.last ∈ ps0, rl.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[ps0[rl.last].next].next ≠ null → vs0[ps0[rl.last].next].next ∈ vs0 ∧ vs0[ps0[rl.last].next].next ∈ ps0 ∧ ps0[vs0[ps0[rl.last].next].next] = vs0[vs0[ps0[rl.last].next].next] ∧ ps0[vs0[ps0[rl.last].next].next].deqID = None ∧ ps0[vs0[ps0[rl.last].next].next].next = null ∧ weak?(owns0(vs0[ps0[rl.last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None, ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
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 inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ', ps0[phead].deqID = None, ps0[ps0[rl.last].next].next = null, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[rl.last].val = vs0[rl.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl.last].next) = None, owns0(rl.last) = None, owns0(node) = Some(tid), rl = orl + ps0[rl.last].next ', rl.last ≠ null, ps0[rl.last].next ≠ phead, ps0[rl.last].next ≠ null, node ≠ phead, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ null, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[rl.last].next ∈ rl, ps0[rl.last].next ∈ ps0, ps0[rl.last].next ∈ vs0, rl.last ∈ ps0, rl.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ phead ∈ orl0, vs0[ps0[rl.last].next].next ≠ null → vs0[ps0[rl.last].next].next ∈ vs0 ∧ vs0[ps0[rl.last].next].next ∈ ps0 ∧ ps0[vs0[ps0[rl.last].next].next] = vs0[vs0[ps0[rl.last].next].next] ∧ ps0[vs0[ps0[rl.last].next].next].deqID = None ∧ ps0[vs0[ps0[rl.last].next].next].next = null ∧ weak?(owns0(vs0[ps0[rl.last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None, ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
Used simplifier rules: ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead, y
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', vs0[qrl0.last].deqID = None, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = null, vs0[qrl0.last].next = null, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ', vs0[qrl0.last].deqID = None, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = null, vs0[qrl0.last].next = null, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0.butlast).last, node ≠ ps0[(orl0 + qrl0.butlast).last].next, orl0 ≠ [], phead0 ≠ (orl0 + qrl0.butlast).last, qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0, (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, (orl0 + qrl0.butlast).last ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ (orl0 + qrl0.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + qrl0.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0.butlast).last].next].next)), ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
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 ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ y → a ∈ x + y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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 inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ', vs0[qrl0.last].deqID = None, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = null, vs0[qrl0.last].next = null, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0.butlast).last, node ≠ ps0[(orl0 + qrl0.butlast).last].next, orl0 ≠ [], phead0 ≠ (orl0 + qrl0.butlast).last, qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0, (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, (orl0 + qrl0.butlast).last ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ (orl0 + qrl0.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0 from (orl0 + qrl0.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + qrl0.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0.butlast).last].next].next)), ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ', vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), qrl0 = vhead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0.butlast).last, node ≠ ps0[(orl0 + qrl0.butlast).last].next, orl0 ≠ [], phead0 ≠ (orl0 + qrl0.butlast).last, qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ (orl0 + qrl0.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0 from (orl0 + qrl0.butlast).last, vs0[ps0[(orl0 + qrl0.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0.butlast).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ', vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), qrl0 = vhead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ null, node ≠ (orl0 + qrl0.butlast).last, node ≠ ps0[(orl0 + qrl0.butlast).last].next, orl0 ≠ [], phead0 ≠ (orl0 + qrl0.butlast).last, qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ (orl0 + qrl0.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ qrl0 from (orl0 + qrl0.butlast).last, vs0[ps0[(orl0 + qrl0.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + qrl0.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + qrl0.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + qrl0.butlast).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None ⊦ |
orl0 + vhead ' + rl = rl1 + (orl0 + (vhead ' + rl).butlast).last ' + ps0[(orl0 + (vhead ' + rl).butlast).last].next ', ps0[vhead].deqID = None, vs0[(vhead ' + rl).last].deqID = None, vs0[(vhead ' + rl).last].next = null, ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next = null, vs0[(orl0 + (vhead ' + rl).butlast).last].next = ps0[(orl0 + (vhead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].val, ps0[(orl0 + (vhead ' + rl).butlast).last].val = vs0[(orl0 + (vhead ' + rl).butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (vhead ' + rl).butlast).last].next) = None, owns0((orl0 + (vhead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (vhead ' + rl).butlast).last ≠ null, ps0[(orl0 + (vhead ' + rl).butlast).last].next ≠ null, node ≠ vhead, node ≠ ps0[(orl0 + (vhead ' + rl).butlast).last].next, node ≠ (orl0 + (vhead ' + rl).butlast).last, node ≠ null, orl0 ≠ [], phead0 ≠ (orl0 + (vhead ' + rl).butlast).last, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), (orl0 + (vhead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ ps0, (orl0 + (vhead ' + rl).butlast).last ∈ vs0, ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ vs0, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID), ¬ weak?(vs0[(orl0 + (vhead ' + rl).butlast).last].deqID), ¬ ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ vhead ' + rl from (orl0 + (vhead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ (orl0 + (vhead ' + rl).butlast).last ∈ orl0, ¬ vhead ∈ rl, ¬ vhead ∈ orl0, vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ≠ null → vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next] = vs0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (vhead ' + rl).butlast).last].deqID = vs0[(orl0 + (vhead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (vhead ' + rl).butlast).last].deqID = None, (orl0 + (vhead ' + rl).butlast).last = vhead ∨ (orl0 + (vhead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (vhead ' + rl).butlast).last].next = vhead ∨ ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ rl ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[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(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s)
| orl0 + vhead ' + rl = rl1 + (orl0 + (vhead ' + rl).butlast).last ' + ps0[(orl0 + (vhead ' + rl).butlast).last].next ', ps0[vhead].deqID = None, vs0[(vhead ' + rl).last].deqID = None, vs0[(vhead ' + rl).last].next = null, ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next = null, vs0[(orl0 + (vhead ' + rl).butlast).last].next = ps0[(orl0 + (vhead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].val, ps0[(orl0 + (vhead ' + rl).butlast).last].val = vs0[(orl0 + (vhead ' + rl).butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (vhead ' + rl).butlast).last].next) = None, owns0((orl0 + (vhead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (vhead ' + rl).butlast).last ≠ null, ps0[(orl0 + (vhead ' + rl).butlast).last].next ≠ null, node ≠ vhead, node ≠ ps0[(orl0 + (vhead ' + rl).butlast).last].next, node ≠ (orl0 + (vhead ' + rl).butlast).last, node ≠ null, orl0 ≠ [], phead0 ≠ (orl0 + (vhead ' + rl).butlast).last, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), (orl0 + (vhead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ ps0, (orl0 + (vhead ' + rl).butlast).last ∈ vs0, ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ vs0, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID), ¬ weak?(vs0[(orl0 + (vhead ' + rl).butlast).last].deqID), ¬ ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ vhead ' + rl from (orl0 + (vhead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ (orl0 + (vhead ' + rl).butlast).last ∈ orl0, ¬ vhead ∈ rl, ¬ vhead ∈ orl0, vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ≠ null → vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next] = vs0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (vhead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (vhead ' + rl).butlast).last].deqID = vs0[(orl0 + (vhead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (vhead ' + rl).butlast).last].deqID = None, (orl0 + (vhead ' + rl).butlast).last = vhead ∨ (orl0 + (vhead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (vhead ' + rl).butlast).last].next = vhead ∨ ps0[(orl0 + (vhead ' + rl).butlast).last].next ∈ rl ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
orl0 + vhead ' + rl = rl1 + (orl0 + vhead ' + rl.butlast).last ' + ps0[(orl0 + vhead ' + rl.butlast).last].next ', vs0[(vhead ' + rl).last].deqID = None, ps0[vhead].deqID = None, vs0[(orl0 + vhead ' + rl.butlast).last].next = ps0[(orl0 + vhead ' + rl.butlast).last].next, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next = null, vs0[(vhead ' + rl).last].next = null, ps0[(orl0 + vhead ' + rl.butlast).last].val = vs0[(orl0 + vhead ' + rl.butlast).last].val, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + vhead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + vhead ' + rl.butlast).last].next) = None, (orl0 + vhead ' + rl.butlast).last ≠ null, ps0[(orl0 + vhead ' + rl.butlast).last].next ≠ null, node ≠ vhead, node ≠ ps0[(orl0 + vhead ' + rl.butlast).last].next, node ≠ (orl0 + vhead ' + rl.butlast).last, node ≠ null, orl0 ≠ [], phead0 ≠ (orl0 + vhead ' + rl.butlast).last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ vs0, (orl0 + vhead ' + rl.butlast).last ∈ vs0, ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ ps0, (orl0 + vhead ' + rl.butlast).last ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID), ¬ weak?(vs0[(orl0 + vhead ' + rl.butlast).last].deqID), ¬ ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ vhead ' + rl from (orl0 + vhead ' + rl.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ (orl0 + vhead ' + rl.butlast).last ∈ orl0, ¬ vhead ∈ rl, ¬ vhead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next)), ps0[(orl0 + vhead ' + rl.butlast).last].next = vhead ∨ ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ rl, (orl0 + vhead ' + rl.butlast).last = vhead ∨ (orl0 + vhead ' + rl.butlast).last ∈ rl, ps0[(orl0 + vhead ' + rl.butlast).last].deqID = vs0[(orl0 + vhead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + vhead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
Used simplifier rules: ⊦ a '.last = a; (s) ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (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: vhead ', rl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl0 + vhead ' + rl = rl1 + (orl0 + vhead ' + rl.butlast).last ' + ps0[(orl0 + vhead ' + rl.butlast).last].next ', vs0[(vhead ' + rl).last].deqID = None, ps0[vhead].deqID = None, vs0[(orl0 + vhead ' + rl.butlast).last].next = ps0[(orl0 + vhead ' + rl.butlast).last].next, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next = null, vs0[(vhead ' + rl).last].next = null, ps0[(orl0 + vhead ' + rl.butlast).last].val = vs0[(orl0 + vhead ' + rl.butlast).last].val, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + vhead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + vhead ' + rl.butlast).last].next) = None, (orl0 + vhead ' + rl.butlast).last ≠ null, ps0[(orl0 + vhead ' + rl.butlast).last].next ≠ null, node ≠ vhead, node ≠ ps0[(orl0 + vhead ' + rl.butlast).last].next, node ≠ (orl0 + vhead ' + rl.butlast).last, node ≠ null, orl0 ≠ [], phead0 ≠ (orl0 + vhead ' + rl.butlast).last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ vs0, (orl0 + vhead ' + rl.butlast).last ∈ vs0, ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ ps0, (orl0 + vhead ' + rl.butlast).last ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID), ¬ weak?(vs0[(orl0 + vhead ' + rl.butlast).last].deqID), ¬ ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ vhead ' + rl from (orl0 + vhead ' + rl.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl1, ¬ (orl0 + vhead ' + rl.butlast).last ∈ orl0, ¬ vhead ∈ rl, ¬ vhead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ≠ null → vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next] = vs0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next] ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].next)), ps0[(orl0 + vhead ' + rl.butlast).last].next = vhead ∨ ps0[(orl0 + vhead ' + rl.butlast).last].next ∈ rl, (orl0 + vhead ' + rl.butlast).last = vhead ∨ (orl0 + vhead ' + rl.butlast).last ∈ rl, ps0[(orl0 + vhead ' + rl.butlast).last].deqID = vs0[(orl0 + vhead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + vhead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + vhead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + vhead ' + rl = rl1 + (vhead ' + rl.butlast).last ' + ps0[(vhead ' + rl.butlast).last].next ', vs0[rl.last].deqID = None, ps0[vhead].deqID = None, vs0[(vhead ' + rl.butlast).last].next = ps0[(vhead ' + rl.butlast).last].next, ps0[ps0[(vhead ' + rl.butlast).last].next].next = null, vs0[rl.last].next = null, ps0[(vhead ' + rl.butlast).last].val = vs0[(vhead ' + rl.butlast).last].val, ps0[ps0[(vhead ' + rl.butlast).last].next].val = vs0[ps0[(vhead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((vhead ' + rl.butlast).last) = None, owns0(ps0[(vhead ' + rl.butlast).last].next) = None, (vhead ' + rl.butlast).last ≠ null, ps0[(vhead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl.butlast).last, node ≠ ps0[(vhead ' + rl.butlast).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl.butlast).last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), (vhead ' + rl.butlast).last ∈ vs0, (vhead ' + rl.butlast).last ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(vhead ' + rl.butlast).last].next ∈ rl, ps0[(vhead ' + rl.butlast).last].next ∈ vs0, ps0[(vhead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(vhead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(vhead ' + rl.butlast).last].next].deqID), ¬ (vhead ' + rl.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl.butlast).last].next ∈ vhead ' + rl from (vhead ' + rl.butlast).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(vhead ' + rl.butlast).last].next].next ≠ null → vs0[ps0[(vhead ' + rl.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(vhead ' + rl.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next] = vs0[vs0[ps0[(vhead ' + rl.butlast).last].next].next] ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(vhead ' + rl.butlast).last].next].next)), (vhead ' + rl.butlast).last = vhead ∨ (vhead ' + rl.butlast).last ∈ rl, ps0[(vhead ' + rl.butlast).last].deqID = vs0[(vhead ' + rl.butlast).last].deqID ∨ ps0[(vhead ' + rl.butlast).last].deqID = None, ps0[ps0[(vhead ' + rl.butlast).last].next].deqID = vs0[ps0[(vhead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(vhead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
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 ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)
| orl0 + vhead ' + rl = rl1 + (vhead ' + rl.butlast).last ' + ps0[(vhead ' + rl.butlast).last].next ', vs0[rl.last].deqID = None, ps0[vhead].deqID = None, vs0[(vhead ' + rl.butlast).last].next = ps0[(vhead ' + rl.butlast).last].next, ps0[ps0[(vhead ' + rl.butlast).last].next].next = null, vs0[rl.last].next = null, ps0[(vhead ' + rl.butlast).last].val = vs0[(vhead ' + rl.butlast).last].val, ps0[ps0[(vhead ' + rl.butlast).last].next].val = vs0[ps0[(vhead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((vhead ' + rl.butlast).last) = None, owns0(ps0[(vhead ' + rl.butlast).last].next) = None, (vhead ' + rl.butlast).last ≠ null, ps0[(vhead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl.butlast).last, node ≠ ps0[(vhead ' + rl.butlast).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl.butlast).last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), (vhead ' + rl.butlast).last ∈ vs0, (vhead ' + rl.butlast).last ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ps0[(vhead ' + rl.butlast).last].next ∈ rl, ps0[(vhead ' + rl.butlast).last].next ∈ vs0, ps0[(vhead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(vhead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(vhead ' + rl.butlast).last].next].deqID), ¬ (vhead ' + rl.butlast).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl.butlast).last].next ∈ vhead ' + rl from (vhead ' + rl.butlast).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[(vhead ' + rl.butlast).last].next].next ≠ null → vs0[ps0[(vhead ' + rl.butlast).last].next].next ∈ vs0 ∧ vs0[ps0[(vhead ' + rl.butlast).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next] = vs0[vs0[ps0[(vhead ' + rl.butlast).last].next].next] ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next].deqID = None ∧ ps0[vs0[ps0[(vhead ' + rl.butlast).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(vhead ' + rl.butlast).last].next].next)), (vhead ' + rl.butlast).last = vhead ∨ (vhead ' + rl.butlast).last ∈ rl, ps0[(vhead ' + rl.butlast).last].deqID = vs0[(vhead ' + rl.butlast).last].deqID ∨ ps0[(vhead ' + rl.butlast).last].deqID = None, ps0[ps0[(vhead ' + rl.butlast).last].next].deqID = vs0[ps0[(vhead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(vhead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + vhead ' + rl = rl1 + (vhead ' + rl0).last ' + ps0[(vhead ' + rl0).last].next ', ps0[vhead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, ps0[ps0[(vhead ' + rl0).last].next].next = null, vs0[(vhead ' + rl0).last].next = ps0[(vhead ' + rl0).last].next, ps0[ps0[(vhead ' + rl0).last].next].val = vs0[ps0[(vhead ' + rl0).last].next].val, ps0[(vhead ' + rl0).last].val = vs0[(vhead ' + rl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(vhead ' + rl0).last].next) = None, owns0((vhead ' + rl0).last) = None, owns0(node) = Some(tid), rl = rl0 + phead ', (vhead ' + rl0).last ≠ null, ps0[(vhead ' + rl0).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl0).last, node ≠ ps0[(vhead ' + rl0).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl0).last, rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(vhead ' + rl0).last].next ∈ ps0, ps0[(vhead ' + rl0).last].next ∈ vs0, ps0[(vhead ' + rl0).last].next ∈ rl, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, (vhead ' + rl0).last ∈ ps0, (vhead ' + rl0).last ∈ vs0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(vhead ' + rl0).last].deqID), ¬ weak?(vs0[ps0[(vhead ' + rl0).last].next].deqID), ¬ (vhead ' + rl0).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ vhead ' + rl from (vhead ' + rl0).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl, vs0[ps0[(vhead ' + rl0).last].next].next ≠ null → vs0[ps0[(vhead ' + rl0).last].next].next ∈ vs0 ∧ vs0[ps0[(vhead ' + rl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next] = vs0[vs0[ps0[(vhead ' + rl0).last].next].next] ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(vhead ' + rl0).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(vhead ' + rl0).last].next].deqID = vs0[ps0[(vhead ' + rl0).last].next].deqID ∨ ps0[ps0[(vhead ' + rl0).last].next].deqID = None, ps0[(vhead ' + rl0).last].deqID = vs0[(vhead ' + rl0).last].deqID ∨ ps0[(vhead ' + rl0).last].deqID = None, (vhead ' + rl0).last = vhead ∨ (vhead ' + rl0).last ∈ rl ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, phead, y
| orl0 + vhead ' + rl = rl1 + (vhead ' + rl0).last ' + ps0[(vhead ' + rl0).last].next ', ps0[vhead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, ps0[ps0[(vhead ' + rl0).last].next].next = null, vs0[(vhead ' + rl0).last].next = ps0[(vhead ' + rl0).last].next, ps0[ps0[(vhead ' + rl0).last].next].val = vs0[ps0[(vhead ' + rl0).last].next].val, ps0[(vhead ' + rl0).last].val = vs0[(vhead ' + rl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(vhead ' + rl0).last].next) = None, owns0((vhead ' + rl0).last) = None, owns0(node) = Some(tid), rl = rl0 + phead ', (vhead ' + rl0).last ≠ null, ps0[(vhead ' + rl0).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl0).last, node ≠ ps0[(vhead ' + rl0).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl0).last, rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(vhead ' + rl0).last].next ∈ ps0, ps0[(vhead ' + rl0).last].next ∈ vs0, ps0[(vhead ' + rl0).last].next ∈ rl, phead0 ∈ rl1, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, (vhead ' + rl0).last ∈ ps0, (vhead ' + rl0).last ∈ vs0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(vhead ' + rl0).last].deqID), ¬ weak?(vs0[ps0[(vhead ' + rl0).last].next].deqID), ¬ (vhead ' + rl0).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ vhead ' + rl from (vhead ' + rl0).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl, vs0[ps0[(vhead ' + rl0).last].next].next ≠ null → vs0[ps0[(vhead ' + rl0).last].next].next ∈ vs0 ∧ vs0[ps0[(vhead ' + rl0).last].next].next ∈ ps0 ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next] = vs0[vs0[ps0[(vhead ' + rl0).last].next].next] ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next].deqID = None ∧ ps0[vs0[ps0[(vhead ' + rl0).last].next].next].next = null ∧ weak?(owns0(vs0[ps0[(vhead ' + rl0).last].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(vhead ' + rl0).last].next].deqID = vs0[ps0[(vhead ' + rl0).last].next].deqID ∨ ps0[ps0[(vhead ' + rl0).last].next].deqID = None, ps0[(vhead ' + rl0).last].deqID = vs0[(vhead ' + rl0).last].deqID ∨ ps0[(vhead ' + rl0).last].deqID = None, (vhead ' + rl0).last = vhead ∨ (vhead ' + rl0).last ∈ rl ⊦ |
orl0 + vhead ' + rl0 = rl1 + (vhead ' + rl0).last ', vs0[ps0[(vhead ' + rl0).last].next].deqID = None, ps0[vhead].deqID = None, ps0[ps0[(vhead ' + rl0).last].next].deqID = None, vs0[(vhead ' + rl0).last].next = ps0[(vhead ' + rl0).last].next, ps0[ps0[(vhead ' + rl0).last].next].next = null, vs0[ps0[(vhead ' + rl0).last].next].next = null, ps0[(vhead ' + rl0).last].val = vs0[(vhead ' + rl0).last].val, ps0[ps0[(vhead ' + rl0).last].next].val = vs0[ps0[(vhead ' + rl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((vhead ' + rl0).last) = None, owns0(ps0[(vhead ' + rl0).last].next) = None, (vhead ' + rl0).last ≠ null, ps0[(vhead ' + rl0).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl0).last, node ≠ ps0[(vhead ' + rl0).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl0).last, tid ≠ tid0, vhead ≠ ps0[(vhead ' + rl0).last].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl0, ps0), (vhead ' + rl0).last ∈ vs0, (vhead ' + rl0).last ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ps0[(vhead ' + rl0).last].next ∈ vs0, ps0[(vhead ' + rl0).last].next ∈ ps0, phead0 ∈ rl1, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ weak?(vs0[(vhead ' + rl0).last].deqID), ¬ ps0[(vhead ' + rl0).last].next ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ rl0, ¬ (vhead ' + rl0).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ' from (vhead ' + rl0).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[(vhead ' + rl0).last].deqID = vs0[(vhead ' + rl0).last].deqID ∨ ps0[(vhead ' + rl0).last].deqID = None, (vhead ' + rl0).last = vhead ∨ (vhead ' + rl0).last ∈ rl0 ∨ (vhead ' + rl0).last = ps0[(vhead ' + rl0).last].next, orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0) ⊦
Used simplifier rules: ⊦ ¬ weak?(None); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[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) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s) ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws)
| orl0 + vhead ' + rl0 = rl1 + (vhead ' + rl0).last ', vs0[ps0[(vhead ' + rl0).last].next].deqID = None, ps0[vhead].deqID = None, ps0[ps0[(vhead ' + rl0).last].next].deqID = None, vs0[(vhead ' + rl0).last].next = ps0[(vhead ' + rl0).last].next, ps0[ps0[(vhead ' + rl0).last].next].next = null, vs0[ps0[(vhead ' + rl0).last].next].next = null, ps0[(vhead ' + rl0).last].val = vs0[(vhead ' + rl0).last].val, ps0[ps0[(vhead ' + rl0).last].next].val = vs0[ps0[(vhead ' + rl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((vhead ' + rl0).last) = None, owns0(ps0[(vhead ' + rl0).last].next) = None, (vhead ' + rl0).last ≠ null, ps0[(vhead ' + rl0).last].next ≠ null, node ≠ null, node ≠ (vhead ' + rl0).last, node ≠ ps0[(vhead ' + rl0).last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ (vhead ' + rl0).last, tid ≠ tid0, vhead ≠ ps0[(vhead ' + rl0).last].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl0, ps0), (vhead ' + rl0).last ∈ vs0, (vhead ' + rl0).last ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ps0[(vhead ' + rl0).last].next ∈ vs0, ps0[(vhead ' + rl0).last].next ∈ ps0, phead0 ∈ rl1, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ weak?(vs0[(vhead ' + rl0).last].deqID), ¬ ps0[(vhead ' + rl0).last].next ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ rl0, ¬ (vhead ' + rl0).last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[(vhead ' + rl0).last].next ∈ vhead ' + rl0 + ps0[(vhead ' + rl0).last].next ' from (vhead ' + rl0).last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[(vhead ' + rl0).last].deqID = vs0[(vhead ' + rl0).last].deqID ∨ ps0[(vhead ' + rl0).last].deqID = None, (vhead ' + rl0).last = vhead ∨ (vhead ' + rl0).last ∈ rl0 ∨ (vhead ' + rl0).last = ps0[(vhead ' + rl0).last].next, orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + vhead ' + rl0 = rl1 + rl0.last ', ps0[ps0[rl0.last].next].deqID = None, ps0[vhead].deqID = None, vs0[ps0[rl0.last].next].deqID = None, vs0[ps0[rl0.last].next].next = null, ps0[ps0[rl0.last].next].next = null, vs0[rl0.last].next = ps0[rl0.last].next, ps0[ps0[rl0.last].next].val = vs0[ps0[rl0.last].next].val, ps0[rl0.last].val = vs0[rl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl0.last].next) = None, owns0(rl0.last) = None, owns0(node) = Some(tid), rl0.last ≠ null, ps0[rl0.last].next ≠ null, node ≠ null, node ≠ rl0.last, node ≠ ps0[rl0.last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, vhead ≠ ps0[rl0.last].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl0, ps0), phead0 ∈ rl1, ps0[rl0.last].next ∈ ps0, ps0[rl0.last].next ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ ps0, rl0.last ∈ vs0, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ weak?(vs0[rl0.last].deqID), ¬ ps0[rl0.last].next ∈ orl0, ¬ ps0[rl0.last].next ∈ rl0, ¬ rl0.last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[rl0.last].next ∈ vhead ' + rl0 + ps0[rl0.last].next ' from rl0.last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0), rl0.last = vhead ∨ rl0.last ∈ rl0 ∨ rl0.last = ps0[rl0.last].next, ps0[rl0.last].deqID = vs0[rl0.last].deqID ∨ ps0[rl0.last].deqID = None ⊦
Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vhead ', rl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + vhead ' + rl0 = rl1 + rl0.last ', ps0[ps0[rl0.last].next].deqID = None, ps0[vhead].deqID = None, vs0[ps0[rl0.last].next].deqID = None, vs0[ps0[rl0.last].next].next = null, ps0[ps0[rl0.last].next].next = null, vs0[rl0.last].next = ps0[rl0.last].next, ps0[ps0[rl0.last].next].val = vs0[ps0[rl0.last].next].val, ps0[rl0.last].val = vs0[rl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl0.last].next) = None, owns0(rl0.last) = None, owns0(node) = Some(tid), rl0.last ≠ null, ps0[rl0.last].next ≠ null, node ≠ null, node ≠ rl0.last, node ≠ ps0[rl0.last].next, node ≠ vhead, orl0 ≠ [], phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, vhead ≠ ps0[rl0.last].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl0, ps0), phead0 ∈ rl1, ps0[rl0.last].next ∈ ps0, ps0[rl0.last].next ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ ps0, rl0.last ∈ vs0, ¬ dups(orl0 + rl0), ¬ dups(orl0), ¬ dups(rl0), ¬ weak?(vs0[rl0.last].deqID), ¬ ps0[rl0.last].next ∈ orl0, ¬ ps0[rl0.last].next ∈ rl0, ¬ rl0.last ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ rl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[rl0.last].next ∈ vhead ' + rl0 + ps0[rl0.last].next ' from rl0.last, ¬ vhead ∈ orl0, ¬ vhead ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0), rl0.last = vhead ∨ rl0.last ∈ rl0 ∨ rl0.last = ps0[rl0.last].next, ps0[rl0.last].deqID = vs0[rl0.last].deqID ∨ ps0[rl0.last].deqID = None ⊦ |
orl0 + vhead ' + rl0 = rl1 + rl0.last ', ps0[ps0[rl0.last].next].deqID = None, ps0[vhead].deqID = None, vs0[ps0[rl0.last].next].deqID = None, vs0[ps0[rl0.last].next].next = null, ps0[ps0[rl0.last].next].next = null, vs0[rl0.last].next = ps0[rl0.last].next, ps0[ps0[rl0.last].next].val = vs0[ps0[rl0.last].next].val, ps0[rl0.last].val = vs0[rl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl0.last].next) = None, owns0(rl0.last) = None, owns0(node) = Some(tid), rl0.last ≠ null, ps0[rl0.last].next ≠ null, node ≠ vhead, node ≠ ps0[rl0.last].next, node ≠ rl0.last, node ≠ null, orl0 ≠ [], phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, vhead ≠ ps0[rl0.last].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl0, ps0), phead0 ∈ rl1, ps0[rl0.last].next ∈ ps0, ps0[rl0.last].next ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ ps0, rl0.last ∈ vs0, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ weak?(vs0[rl0.last].deqID), ¬ vhead ∈ rl0, ¬ vhead ∈ orl0, ¬ ps0[rl0.last].next ∈ vhead ' + rl0 + ps0[rl0.last].next ' from rl0.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ rl0.last ∈ orl0, ¬ ps0[rl0.last].next ∈ rl0, ¬ ps0[rl0.last].next ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0), ps0[rl0.last].deqID = vs0[rl0.last].deqID ∨ ps0[rl0.last].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]
| orl0 + vhead ' + rl0 = rl1 + rl0.last ', ps0[ps0[rl0.last].next].deqID = None, ps0[vhead].deqID = None, vs0[ps0[rl0.last].next].deqID = None, vs0[ps0[rl0.last].next].next = null, ps0[ps0[rl0.last].next].next = null, vs0[rl0.last].next = ps0[rl0.last].next, ps0[ps0[rl0.last].next].val = vs0[ps0[rl0.last].next].val, ps0[rl0.last].val = vs0[rl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl0.last].next) = None, owns0(rl0.last) = None, owns0(node) = Some(tid), rl0.last ≠ null, ps0[rl0.last].next ≠ null, node ≠ vhead, node ≠ ps0[rl0.last].next, node ≠ rl0.last, node ≠ null, orl0 ≠ [], phead0 ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, vhead ≠ ps0[rl0.last].next, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vhead0, vs0), nonullRetRefs(orl0 + vhead ' + rl0 + ps0[rl0.last].next ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl0, ps0), phead0 ∈ rl1, ps0[rl0.last].next ∈ ps0, ps0[rl0.last].next ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, rl0.last ∈ ps0, rl0.last ∈ vs0, ¬ dups(rl0), ¬ dups(orl0), ¬ dups(orl0 + rl0), ¬ weak?(vs0[rl0.last].deqID), ¬ vhead ∈ rl0, ¬ vhead ∈ orl0, ¬ ps0[rl0.last].next ∈ vhead ' + rl0 + ps0[rl0.last].next ' from rl0.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ node ∈ rl1, ¬ rl0.last ∈ orl0, ¬ ps0[rl0.last].next ∈ rl0, ¬ ps0[rl0.last].next ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl0, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[vhead].deqID = None ∧ unmarkedp(rl0, vs0), ps0[rl0.last].deqID = vs0[rl0.last].deqID ∨ ps0[rl0.last].deqID = None ⊦ |
Used simplifier rules: ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ 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) ⊦ 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 ∈ b ' ↔ a = b; (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: rl0, phead, y
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = lst0 + rl0, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ' + vs0[ps0[(phead ' + rl).last].next].next ' + rl0, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = vs0[ps0[(phead ' + rl).last].next].next, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(phead ' + rl).last].next].next, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
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.last ∈ x ↔ x ≠ []; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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)
| orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ' + vs0[ps0[(phead ' + rl).last].next].next ' + rl0, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = vs0[ps0[(phead ' + rl).last].next].next, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(phead ' + rl).last].next].next, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + vs0[ps0[rl.last].next].next ' + rl0, ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ null, node ≠ vs0[ps0[rl.last].next].next, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[rl.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[rl.last].deqID), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦
Used simplifier rules: ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + vs0[ps0[rl.last].next].next ' + rl0, ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ null, node ≠ vs0[ps0[rl.last].next].next, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[rl.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[rl.last].deqID), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (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: rl, vhead, y
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0.butlast).last ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + qrl0.butlast).last ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0[(phead ' + rl).last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, vs0[(phead ' + rl).last].next = null, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl ⊦
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) ⊦ 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)
| orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0[(phead ' + rl).last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, vs0[(phead ' + rl).last].next = null, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, rl = [], (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
orl0 + phead ' + rl = rl1 + (orl0 + phead ' + rl.butlast).last ' + ps0[(orl0 + phead ' + rl.butlast).last].next ' + vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + phead ' + rl.butlast).last].next = ps0[(orl0 + phead ' + rl.butlast).last].next, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].next = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, ps0[(orl0 + phead ' + rl.butlast).last].val = vs0[(orl0 + phead ' + rl.butlast).last].val, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + phead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + phead ' + rl.butlast).last].next) = None, (orl0 + phead ' + rl.butlast).last ≠ null, ps0[(orl0 + phead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, node ≠ ps0[(orl0 + phead ' + rl.butlast).last].next, node ≠ (orl0 + phead ' + rl.butlast).last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + phead ' + rl.butlast).last ∈ vs0, (orl0 + phead ' + rl.butlast).last ∈ ps0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ vs0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + phead ' + rl.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + phead ' + rl.butlast).last ∈ orl0 ∨ (orl0 + phead ' + rl.butlast).last = phead ∨ (orl0 + phead ' + rl.butlast).last ∈ rl, ps0[(orl0 + phead ' + rl.butlast).last].deqID = vs0[(orl0 + phead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + phead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, rl = [], (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', vs0[phead].deqID = None, ps0[phead].deqID = None, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, vs0[orl0.last].next = ps0[orl0.last].next, vs0[phead].next = null, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[orl0.last].val = vs0[orl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, owns0(ps0[orl0.last].next) = None, owns0(orl0.last) = None, owns0(node) = Some(tid), orl0.last ≠ orl0.butlast.last, orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ orl0.head ', orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, phead0 ≠ orl0.last, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl2 + phead ', vs0, ps0, owns0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, orl0.butlast.last, vs0), noid(tid, orl0 + phead ', orl0.butlast.last, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), ps0[orl0.last].next ∈ ps0, ps0[orl0.last].next ∈ vs0, orl0.last ∈ ps0, orl0.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ orl0.butlast.last ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[orl0.butlast.last].next ≠ null ∧ vs0[vs0[orl0.butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.butlast.last].next].deqID.tid, vs0[vs0[orl0.butlast.last].next].val), vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + y = z + y ↔ x = z; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (x + a ').last = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) ⊦ ¬ c ∈ y ∧ c ≠ b → y + b ' ≠ y0 + c ' + z; (s) ⊦ a ' + x ≠ []; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', vs0[phead].deqID = None, ps0[phead].deqID = None, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, vs0[orl0.last].next = ps0[orl0.last].next, vs0[phead].next = null, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[orl0.last].val = vs0[orl0.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, owns0(ps0[orl0.last].next) = None, owns0(orl0.last) = None, owns0(node) = Some(tid), orl0.last ≠ orl0.butlast.last, orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ orl0.head ', orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, phead0 ≠ orl0.last, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl2 + phead ', vs0, ps0, owns0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, orl0.butlast.last, vs0), noid(tid, orl0 + phead ', orl0.butlast.last, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), ps0[orl0.last].next ∈ ps0, ps0[orl0.last].next ∈ vs0, orl0.last ∈ ps0, orl0.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ orl0.butlast.last ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[orl0.butlast.last].next ≠ null ∧ vs0[vs0[orl0.butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.butlast.last].next].deqID.tid, vs0[vs0[orl0.butlast.last].next].val), vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0 ⊦ |
vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[orl0.last].next = ps0[orl0.last].next, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, ps0[orl0.last].val = vs0[orl0.last].val, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, orl0 = node0 + rl, owns0(node) = Some(tid), owns0(orl0.last) = None, owns0(ps0[orl0.last].next) = None, orl0.last ≠ orl0.butlast.last, orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ node0 ', orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, phead0 ≠ orl0.last, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ', vs0, ps0, owns0), listp(rl2 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, orl0.butlast.last, vs0), noid(tid, orl0 + phead ', orl0.butlast.last, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, orl0.last ∈ vs0, orl0.last ∈ ps0, ps0[orl0.last].next ∈ vs0, ps0[orl0.last].next ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ orl0.butlast.last ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[orl0.butlast.last].next ≠ null ∧ vs0[vs0[orl0.butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.butlast.last].next].deqID.tid, vs0[vs0[orl0.butlast.last].next].val), phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl0, head, tail
| vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[orl0.last].next = ps0[orl0.last].next, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, ps0[orl0.last].val = vs0[orl0.last].val, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, orl0 = node0 + rl, owns0(node) = Some(tid), owns0(orl0.last) = None, owns0(ps0[orl0.last].next) = None, orl0.last ≠ orl0.butlast.last, orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ node0 ', orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, phead0 ≠ orl0.last, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ', vs0, ps0, owns0), listp(rl2 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, orl0.butlast.last, vs0), noid(tid, orl0 + phead ', orl0.butlast.last, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, orl0.last ∈ vs0, orl0.last ∈ ps0, ps0[orl0.last].next ∈ vs0, ps0[orl0.last].next ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ orl0.butlast.last ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[orl0.butlast.last].next ≠ null ∧ vs0[vs0[orl0.butlast.last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[orl0.butlast.last].next].deqID.tid)) = Claimed(vs0[vs0[orl0.butlast.last].next].deqID.tid, vs0[vs0[orl0.butlast.last].next].val), phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead ⊦ |
vs0[ps0[rl.last].next].next ' + rl0 = rl2 + phead ', node0 ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + rl2, ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, (node0 ' + rl.butlast).last ≠ node0, rl.last ≠ null, rl.last ≠ (node0 ' + rl.butlast).last, ps0[rl.last].next ≠ null, node ≠ node0, node ≠ rl.last, node ≠ ps0[rl.last].next, node ≠ vs0[ps0[rl.last].next].next, node ≠ null, node ≠ phead, phead ≠ node0, phead ≠ rl.last, phead ≠ ps0[rl.last].next, phead0 ≠ rl.last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((node0 ' + rl) + phead ', vs0, ps0, owns0), listp(rl2 + phead ', vs0, ps0, owns0), markedp(rl, vs0), markedp(rl, ps0), nextnottid(tid, (node0 ' + rl.butlast).last, vs0), noid(tid, (node0 ' + rl) + phead ', (node0 ' + rl.butlast).last, vs0), nonullRetRefs((node0 ' + rl) + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[node0].deqID), some?(ps0[node0].deqID), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, node0 ∈ rl1, ¬ dups(rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ (node0 ' + rl) + phead ' from rl.last, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ (node0 ' + rl.butlast).last ∈ rl, ¬ node0 ∈ rl, vs0[(node0 ' + rl.butlast).last].next ≠ null ∧ vs0[vs0[(node0 ' + rl.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(node0 ' + rl.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(node0 ' + rl.butlast).last].next].deqID.tid, vs0[vs0[(node0 ' + rl.butlast).last].next].val), phead = vs0[ps0[rl.last].next].next ∨ phead ∈ rl0, phead ∈ rl0 ∨ phead = vs0[ps0[rl.last].next].next ∨ phead ∈ rl1, ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None, phead0 = node0 ∨ phead0 ∈ rl, vs0[ps0[rl.last].next].next ∈ rl2 ∨ vs0[ps0[rl.last].next].next = phead ⊦
Used simplifier rules: ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ y → (y + c ' + z = a ' + z0 ↔ y = [] ∧ c = a ∧ z = z0); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ a ' + x ≠ []; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws)
| vs0[ps0[rl.last].next].next ' + rl0 = rl2 + phead ', node0 ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + rl2, ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, (node0 ' + rl.butlast).last ≠ node0, rl.last ≠ null, rl.last ≠ (node0 ' + rl.butlast).last, ps0[rl.last].next ≠ null, node ≠ node0, node ≠ rl.last, node ≠ ps0[rl.last].next, node ≠ vs0[ps0[rl.last].next].next, node ≠ null, node ≠ phead, phead ≠ node0, phead ≠ rl.last, phead ≠ ps0[rl.last].next, phead0 ≠ rl.last, rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((node0 ' + rl) + phead ', vs0, ps0, owns0), listp(rl2 + phead ', vs0, ps0, owns0), markedp(rl, vs0), markedp(rl, ps0), nextnottid(tid, (node0 ' + rl.butlast).last, vs0), noid(tid, (node0 ' + rl) + phead ', (node0 ' + rl.butlast).last, vs0), nonullRetRefs((node0 ' + rl) + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs0[node0].deqID), some?(ps0[node0].deqID), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, node0 ∈ rl1, ¬ dups(rl), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ weak?(vs0[rl.last].deqID), ¬ ps0[rl.last].next ∈ (node0 ' + rl) + phead ' from rl.last, ¬ node ∈ rl1, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ node ∈ rl, ¬ (node0 ' + rl.butlast).last ∈ rl, ¬ node0 ∈ rl, vs0[(node0 ' + rl.butlast).last].next ≠ null ∧ vs0[vs0[(node0 ' + rl.butlast).last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[(node0 ' + rl.butlast).last].next].deqID.tid)) = Claimed(vs0[vs0[(node0 ' + rl.butlast).last].next].deqID.tid, vs0[vs0[(node0 ' + rl.butlast).last].next].val), phead = vs0[ps0[rl.last].next].next ∨ phead ∈ rl0, phead ∈ rl0 ∨ phead = vs0[ps0[rl.last].next].next ∨ phead ∈ rl1, ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None, phead0 = node0 ∨ phead0 ∈ rl, vs0[ps0[rl.last].next].next ∈ rl2 ∨ vs0[ps0[rl.last].next].next = phead ⊦ |
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) ⊦ 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) ⊦ some?(opttid) → opttid ≠ None; (as) in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x + b ' = y + c ' + a0 ' + z ∧ a ≠ b ∧ ¬ a ∈ x ∧ ¬ b ∈ x ∧ c ∈ z → dups(x); (s) x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, node1, y
| orl0 + phead ' + rl = rl1 + (orl0 + phead ' + rl.butlast).last ' + ps0[(orl0 + phead ' + rl.butlast).last].next ' + vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + phead ' + rl.butlast).last].next = ps0[(orl0 + phead ' + rl.butlast).last].next, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].next = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, ps0[(orl0 + phead ' + rl.butlast).last].val = vs0[(orl0 + phead ' + rl.butlast).last].val, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + phead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + phead ' + rl.butlast).last].next) = None, (orl0 + phead ' + rl.butlast).last ≠ null, ps0[(orl0 + phead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, node ≠ ps0[(orl0 + phead ' + rl.butlast).last].next, node ≠ (orl0 + phead ' + rl.butlast).last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (orl0 + phead ' + rl.butlast).last ∈ vs0, (orl0 + phead ' + rl.butlast).last ∈ ps0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ vs0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(orl0 + phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + phead ' + rl.butlast).last, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + phead ' + rl.butlast).last ∈ orl0 ∨ (orl0 + phead ' + rl.butlast).last = phead ∨ (orl0 + phead ' + rl.butlast).last ∈ rl, ps0[(orl0 + phead ' + rl.butlast).last].deqID = vs0[(orl0 + phead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + phead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl.butlast).last ' + ps0[(phead ' + rl.butlast).last].next ' + vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0[rl.last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl.butlast).last].next].next = vs0[ps0[(phead ' + rl.butlast).last].next].next, vs0[(phead ' + rl.butlast).last].next = ps0[(phead ' + rl.butlast).last].next, vs0[rl.last].next = null, ps0[ps0[(phead ' + rl.butlast).last].next].val = vs0[ps0[(phead ' + rl.butlast).last].next].val, ps0[(phead ' + rl.butlast).last].val = vs0[(phead ' + rl.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl.butlast).last].next) = None, owns0((phead ' + rl.butlast).last) = None, owns0(node) = Some(tid), (phead ' + rl.butlast).last ≠ null, ps0[(phead ' + rl.butlast).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl.butlast).last].next].next, node ≠ ps0[(phead ' + rl.butlast).last].next, node ≠ (phead ' + rl.butlast).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl.butlast).last].next ∈ ps0, ps0[(phead ' + rl.butlast).last].next ∈ vs0, (phead ' + rl.butlast).last ∈ ps0, (phead ' + rl.butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl.butlast).last].next].deqID), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(phead ' + rl.butlast).last].next].deqID = vs0[ps0[(phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(phead ' + rl.butlast).last].next].deqID = None, ps0[(phead ' + rl.butlast).last].deqID = vs0[(phead ' + rl.butlast).last].deqID ∨ ps0[(phead ' + rl.butlast).last].deqID = None, (phead ' + rl.butlast).last ∈ orl0 ∨ (phead ' + rl.butlast).last = phead ∨ (phead ' + rl.butlast).last ∈ rl ⊦
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)
| orl0 + phead ' + rl = rl1 + (phead ' + rl.butlast).last ' + ps0[(phead ' + rl.butlast).last].next ' + vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0[rl.last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl.butlast).last].next].next = vs0[ps0[(phead ' + rl.butlast).last].next].next, vs0[(phead ' + rl.butlast).last].next = ps0[(phead ' + rl.butlast).last].next, vs0[rl.last].next = null, ps0[ps0[(phead ' + rl.butlast).last].next].val = vs0[ps0[(phead ' + rl.butlast).last].next].val, ps0[(phead ' + rl.butlast).last].val = vs0[(phead ' + rl.butlast).last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl.butlast).last].next) = None, owns0((phead ' + rl.butlast).last) = None, owns0(node) = Some(tid), (phead ' + rl.butlast).last ≠ null, ps0[(phead ' + rl.butlast).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl.butlast).last].next].next, node ≠ ps0[(phead ' + rl.butlast).last].next, node ≠ (phead ' + rl.butlast).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl.butlast).last].next ∈ ps0, ps0[(phead ' + rl.butlast).last].next ∈ vs0, (phead ' + rl.butlast).last ∈ ps0, (phead ' + rl.butlast).last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl.butlast).last].next].deqID), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(phead ' + rl.butlast).last].next].deqID = vs0[ps0[(phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(phead ' + rl.butlast).last].next].deqID = None, ps0[(phead ' + rl.butlast).last].deqID = vs0[(phead ' + rl.butlast).last].deqID ∨ ps0[(phead ' + rl.butlast).last].deqID = None, (phead ' + rl.butlast).last ∈ orl0 ∨ (phead ' + rl.butlast).last = phead ∨ (phead ' + rl.butlast).last ∈ rl ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, rl = rl2 + vhead ', (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ ps0[(phead ' + rl2).last].next, node ≠ (phead ' + rl2).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl, ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead, y
| orl0 + phead ' + rl = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, rl = rl2 + vhead ', (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ ps0[(phead ' + rl2).last].next, node ≠ (phead ' + rl2).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl, ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + phead ' + rl2 + vhead ' = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ vhead, node ≠ (phead ' + rl2).last, node ≠ ps0[(phead ' + rl2).last].next, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl2 + vhead ' from (phead ' + rl2).last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl2 ∨ (phead ' + rl2).last = vhead, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, vhead ∈ rl1 ∨ vhead = (phead ' + rl2).last ∨ vhead = ps0[(phead ' + rl2).last].next ∨ vhead = vs0[ps0[(phead ' + rl2).last].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (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)
| orl0 + phead ' + rl2 + vhead ' = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ vhead, node ≠ (phead ' + rl2).last, node ≠ ps0[(phead ' + rl2).last].next, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl2 + vhead ' from (phead ' + rl2).last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl2 ∨ (phead ' + rl2).last = vhead, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, vhead ∈ rl1 ∨ vhead = (phead ' + rl2).last ∨ vhead = ps0[(phead ' + rl2).last].next ∨ vhead = vs0[ps0[(phead ' + rl2).last].next].next ∨ vhead ∈ rl0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl2 + vhead ' = rl1 + rl2.last ' + ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, vs0[rl2.last].next = ps0[rl2.last].next, vs0[vhead].next = null, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[rl2.last].val = vs0[rl2.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl2.last].next) = None, owns0(rl2.last) = None, owns0(node) = Some(tid), rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[rl2.last].next ∈ ps0, ps0[rl2.last].next ∈ vs0, rl2.last ∈ ps0, rl2.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ orl0 + phead ' + rl2 + vhead ' from rl2.last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ∈ rl1 ∨ vhead = rl2.last ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), rl2.last ∈ orl0 ∨ rl2.last = phead ∨ rl2.last ∈ rl2 ∨ rl2.last = vhead ⊦
Used simplifier rules: ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ weak?(None); (s) ⊦ x + y = z + y ↔ x = z; (s) ⊦ x = y + x ↔ y = []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', rl2
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl2 + vhead ' = rl1 + rl2.last ' + ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, vs0[rl2.last].next = ps0[rl2.last].next, vs0[vhead].next = null, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[rl2.last].val = vs0[rl2.last].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl2.last].next) = None, owns0(rl2.last) = None, owns0(node) = Some(tid), rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[rl2.last].next ∈ ps0, ps0[rl2.last].next ∈ vs0, rl2.last ∈ ps0, rl2.last ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ orl0 + phead ' + rl2 + vhead ' from rl2.last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ∈ rl1 ∨ vhead = rl2.last ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), rl2.last ∈ orl0 ∨ rl2.last = phead ∨ rl2.last ∈ rl2 ∨ rl2.last = vhead ⊦ |
orl0 + phead ' + rl2 = rl1 + rl2.last ' + orl, ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0 = orl + vhead ', ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[rl2.last].next = ps0[rl2.last].next, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, ps0[rl2.last].val = vs0[rl2.last].val, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl2.last) = None, owns0(ps0[rl2.last].next) = None, rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ rl2.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + rl2.last ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + rl2.last ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + rl2.last ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl2.last ∈ vs0, rl2.last ∈ ps0, ps0[rl2.last].next ∈ vs0, ps0[rl2.last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ rl1 + rl2.last ' + orl + vhead ' from rl2.last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[rl2.last].next ∈ orl ∨ ps0[rl2.last].next = vhead, vhead ∈ rl1 ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, vhead ∈ rl0 ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead = ps0[rl2.last].next ∨ vhead ∈ rl1, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = z + y ↔ x = z; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)
| orl0 + phead ' + rl2 = rl1 + rl2.last ' + orl, ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0 = orl + vhead ', ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[rl2.last].next = ps0[rl2.last].next, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, ps0[rl2.last].val = vs0[rl2.last].val, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl2.last) = None, owns0(ps0[rl2.last].next) = None, rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ rl2.last, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + rl2.last ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + rl2.last ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + rl2.last ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, rl2.last ∈ vs0, rl2.last ∈ ps0, ps0[rl2.last].next ∈ vs0, ps0[rl2.last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ rl1 + rl2.last ' + orl + vhead ' from rl2.last, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[rl2.last].next ∈ orl ∨ ps0[rl2.last].next = vhead, vhead ∈ rl1 ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, vhead ∈ rl0 ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead = ps0[rl2.last].next ∨ vhead ∈ rl1, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0 ⊦ |
ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl2 = rl1 + node0 ' + orl, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl2 = rl + node0 ', ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, ps0[node0].deqID = vs0[node0].deqID ∨ ps0[node0].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), vhead ∈ rl0 ∨ vhead = vs0[ps0[node0].next].next ∨ vhead = ps0[node0].next ∨ vhead ∈ rl1, vhead ∈ rl1 ∨ vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, node0, y
| ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl2 = rl1 + node0 ' + orl, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl2 = rl + node0 ', ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ vhead0 ∈ orl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ node ∈ rl1, ¬ phead ∈ orl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, ps0[node0].deqID = vs0[node0].deqID ∨ ps0[node0].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), vhead ∈ rl0 ∨ vhead = vs0[ps0[node0].next].next ∨ vhead = ps0[node0].next ∨ vhead ∈ rl1, vhead ∈ rl1 ∨ vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦ |
ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[node0].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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 inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[node0].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ 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] ⊦ ¬ 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) Used terms: rl1, node0 ' + orl + vhead ', node0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ qrl0 from vhead0, ¬ vhead0 ∈ orl0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ (x + a ' + y).last = (a ' + y).last; (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: orl0, phead, y
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ ps0[lst].next ∈ orl0 + qrl0 from lst ∧ vhead0 ∈ (orl0 from vhead0) + qrl0 |
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
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 ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs0, ps0, owns0)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used terms: ps0, orl0 + qrl0, owns0, lst, vs0
| ⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)) |
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), listp(orl0 + qrl0, vs0, ps0, owns0) ∧ lst ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs0, ps0, owns0)), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(lst ' + rl2, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(lst ' + rl2, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), rl2 = lst0 + rl, ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: reflist freely generated by [], +;; ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; 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)
| orl0 + qrl0 = rl1 + lst ' + rl2, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), rl2 = lst0 + rl, ps0[lst].next ≠ null, node ≠ null, node ≠ lst, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl2, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = [], ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = lst0 + rl0, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: reflist freely generated by [], +;;
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = [], ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', ps0[ps0[lst].next].next = null, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ ¬ 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) ⊦ x + [] = x; (s)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ', ps0[ps0[lst].next].next = null, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ ps0[lst].next, node ≠ lst, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, vs0[ps0[lst].next].next ≠ null → vs0[ps0[lst].next].next ∈ vs0 ∧ vs0[ps0[lst].next].next ∈ ps0 ∧ ps0[vs0[ps0[lst].next].next] = vs0[vs0[ps0[lst].next].next] ∧ ps0[vs0[ps0[lst].next].next].deqID = None ∧ ps0[vs0[ps0[lst].next].next].next = null ∧ weak?(owns0(vs0[ps0[lst].next].next)), vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ps0[lst].next ∈ orl0 ∨ ps0[lst].next ∈ qrl0 ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
Used simplifier rules: in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) ⊦ rl.last ∈ rl from r ↔ r ∈ rl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) Used terms: orl0 + qrl0, rl1 + lst ', ps0[lst].next
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + rl, vs0[lst].next = ps0[lst].next, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(lst) = None, owns0(node) = Some(tid), rl = lst0 + rl0, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(ps0[lst].next ' + rl, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ 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)
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, ps0[lst].val = vs0[lst].val, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(lst) = None, owns0(ps0[lst].next) = None, ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, lst ∈ vs0, lst ∈ ps0, ps0[lst].next ∈ vs0, ps0[lst].next ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None ⊦ |
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦
orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0).last].next) = None, owns0((orl0 + qrl0).last) = None, owns0(node) = Some(tid), (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0).last].next ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, (orl0 + qrl0).last ∈ ps0, (orl0 + qrl0).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None, ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦
Used simplifier rules: ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl0, phead, y
| orl0 + qrl0 = rl1 + (orl0 + qrl0).last ' + ps0[(orl0 + qrl0).last].next ' + vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0[(orl0 + qrl0).last].next = ps0[(orl0 + qrl0).last].next, ps0[ps0[(orl0 + qrl0).last].next].next = vs0[ps0[(orl0 + qrl0).last].next].next, ps0[(orl0 + qrl0).last].val = vs0[(orl0 + qrl0).last].val, ps0[ps0[(orl0 + qrl0).last].next].val = vs0[ps0[(orl0 + qrl0).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0).last) = None, owns0(ps0[(orl0 + qrl0).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0).last ≠ null, ps0[(orl0 + qrl0).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0).last].next].next, node ≠ ps0[(orl0 + qrl0).last].next, node ≠ (orl0 + qrl0).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + qrl0).last ∈ vs0, (orl0 + qrl0).last ∈ ps0, ps0[(orl0 + qrl0).last].next ∈ vs0, ps0[(orl0 + qrl0).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0).last].next ∈ orl0 + qrl0 from (orl0 + qrl0).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0).last ∈ orl0 ∨ (orl0 + qrl0).last ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(rl, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[(orl0 + qrl0).last].deqID = vs0[(orl0 + qrl0).last].deqID ∨ ps0[(orl0 + qrl0).last].deqID = None, ps0[ps0[(orl0 + qrl0).last].next].deqID = vs0[ps0[(orl0 + qrl0).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0).last].next].deqID = None ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ' + vs0[ps0[(phead ' + rl).last].next].next ' + rl0, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = vs0[ps0[(phead ' + rl).last].next].next, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(phead ' + rl).last].next].next, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
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 ≠ []; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (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)
| orl0 + phead ' + rl = rl1 + (phead ' + rl).last ' + ps0[(phead ' + rl).last].next ' + vs0[ps0[(phead ' + rl).last].next].next ' + rl0, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl).last].next].next = vs0[ps0[(phead ' + rl).last].next].next, vs0[(phead ' + rl).last].next = ps0[(phead ' + rl).last].next, ps0[ps0[(phead ' + rl).last].next].val = vs0[ps0[(phead ' + rl).last].next].val, ps0[(phead ' + rl).last].val = vs0[(phead ' + rl).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl).last].next) = None, owns0((phead ' + rl).last) = None, owns0(node) = Some(tid), (phead ' + rl).last ≠ null, ps0[(phead ' + rl).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(phead ' + rl).last].next].next, node ≠ ps0[(phead ' + rl).last].next, node ≠ (phead ' + rl).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(phead ' + rl).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl).last].next ∈ ps0, ps0[(phead ' + rl).last].next ∈ vs0, (phead ' + rl).last ∈ ps0, (phead ' + rl).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl).last].next ∈ orl0 + phead ' + rl from (phead ' + rl).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[(phead ' + rl).last].next].deqID = vs0[ps0[(phead ' + rl).last].next].deqID ∨ ps0[ps0[(phead ' + rl).last].next].deqID = None, ps0[(phead ' + rl).last].deqID = vs0[(phead ' + rl).last].deqID ∨ ps0[(phead ' + rl).last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + vs0[ps0[rl.last].next].next ' + rl0, ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ null, node ≠ vs0[ps0[rl.last].next].next, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[rl.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[rl.last].deqID), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦
Used simplifier rules: ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ' + x ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl = rl1 + rl.last ' + ps0[rl.last].next ' + vs0[ps0[rl.last].next].next ' + rl0, ps0[phead].deqID = None, vs0[rl.last].next = ps0[rl.last].next, ps0[ps0[rl.last].next].next = vs0[ps0[rl.last].next].next, ps0[rl.last].val = vs0[rl.last].val, ps0[ps0[rl.last].next].val = vs0[ps0[rl.last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl.last) = None, owns0(ps0[rl.last].next) = None, rl.last ≠ null, ps0[rl.last].next ≠ null, node ≠ null, node ≠ vs0[ps0[rl.last].next].next, node ≠ ps0[rl.last].next, node ≠ rl.last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[rl.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, rl.last ∈ vs0, rl.last ∈ ps0, ps0[rl.last].next ∈ vs0, ps0[rl.last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[rl.last].deqID), ¬ weak?(vs0[ps0[rl.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[rl.last].next ∈ orl0 + phead ' + rl from rl.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[rl.last].deqID = vs0[rl.last].deqID ∨ ps0[rl.last].deqID = None, ps0[ps0[rl.last].next].deqID = vs0[ps0[rl.last].next].deqID ∨ ps0[ps0[rl.last].next].deqID = None ⊦ |
Used simplifier rules: ⊦ x + a ' ≠ []; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ ¬ a ∈ y ∧ ¬ a ∈ z ∧ a ≠ c → y + c ' + z ≠ y1 + a ' + x; (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: rl, vhead, y
| orl0 + qrl0 = rl1 + lst ' + ps0[lst].next ' + vs0[ps0[lst].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[lst].next].next = vs0[ps0[lst].next].next, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, ps0[ps0[lst].next].val = vs0[ps0[lst].next].val, ps0[lst].val = vs0[lst].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, lst = (orl0 + qrl0.butlast).last, owns0(ps0[lst].next) = None, owns0(lst) = None, owns0(node) = Some(tid), ps0[lst].next ≠ null, lst ≠ null, node ≠ null, node ≠ lst, node ≠ ps0[lst].next, node ≠ vs0[ps0[lst].next].next, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[lst].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[lst].next ∈ ps0, ps0[lst].next ∈ vs0, lst ∈ ps0, lst ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs0[ps0[lst].next].deqID), ¬ weak?(vs0[lst].deqID), ¬ node ∈ rl1, ¬ ps0[lst].next ∈ orl0 + qrl0 from lst, ¬ node ∈ qrl0, ¬ node ∈ orl0, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[lst].next].deqID = vs0[ps0[lst].next].deqID ∨ ps0[ps0[lst].next].deqID = None, ps0[lst].deqID = vs0[lst].deqID ∨ ps0[lst].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0 ⊦
Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, vs0[qrl0.last].next = null, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, owns0((orl0 + qrl0.butlast).last) = None, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, (orl0 + qrl0.butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0 ⊦ |
orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + qrl0.butlast).last ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| orl0 + qrl0 = rl1 + (orl0 + qrl0.butlast).last ' + ps0[(orl0 + qrl0.butlast).last].next ' + vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[(orl0 + qrl0.butlast).last].next = ps0[(orl0 + qrl0.butlast).last].next, ps0[ps0[(orl0 + qrl0.butlast).last].next].next = vs0[ps0[(orl0 + qrl0.butlast).last].next].next, ps0[(orl0 + qrl0.butlast).last].val = vs0[(orl0 + qrl0.butlast).last].val, ps0[ps0[(orl0 + qrl0.butlast).last].next].val = vs0[ps0[(orl0 + qrl0.butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + qrl0.butlast).last) = None, owns0(ps0[(orl0 + qrl0.butlast).last].next) = None, qrl0 = phead + rl, (orl0 + qrl0.butlast).last ≠ null, ps0[(orl0 + qrl0.butlast).last].next ≠ null, node ≠ vs0[ps0[(orl0 + qrl0.butlast).last].next].next, node ≠ ps0[(orl0 + qrl0.butlast).last].next, node ≠ (orl0 + qrl0.butlast).last, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + qrl0.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + qrl0.butlast).last ∈ vs0, (orl0 + qrl0.butlast).last ∈ ps0, ps0[(orl0 + qrl0.butlast).last].next ∈ vs0, ps0[(orl0 + qrl0.butlast).last].next ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs0[(orl0 + qrl0.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID), ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ qrl0, ¬ ps0[(orl0 + qrl0.butlast).last].next ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ rl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + qrl0.butlast).last ∈ orl0 ∨ (orl0 + qrl0.butlast).last ∈ qrl0, ps0[(orl0 + qrl0.butlast).last].deqID = vs0[(orl0 + qrl0.butlast).last].deqID ∨ ps0[(orl0 + qrl0.butlast).last].deqID = None, ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = vs0[ps0[(orl0 + qrl0.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + qrl0.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0[(phead ' + rl).last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, vs0[(phead ' + rl).last].next = null, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl ⊦
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) ⊦ 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)
| orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0[(phead ' + rl).last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, vs0[(phead ' + rl).last].next = null, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(node) = Some(tid), (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, rl = [], (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
orl0 + phead ' + rl = rl1 + (orl0 + phead ' + rl.butlast).last ' + ps0[(orl0 + phead ' + rl.butlast).last].next ' + vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + phead ' + rl.butlast).last].next = ps0[(orl0 + phead ' + rl.butlast).last].next, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].next = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, ps0[(orl0 + phead ' + rl.butlast).last].val = vs0[(orl0 + phead ' + rl.butlast).last].val, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + phead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + phead ' + rl.butlast).last].next) = None, (orl0 + phead ' + rl.butlast).last ≠ null, ps0[(orl0 + phead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, node ≠ ps0[(orl0 + phead ' + rl.butlast).last].next, node ≠ (orl0 + phead ' + rl.butlast).last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + phead ' + rl.butlast).last ∈ vs0, (orl0 + phead ' + rl.butlast).last ∈ ps0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ vs0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + phead ' + rl.butlast).last ∈ orl0 ∨ (orl0 + phead ' + rl.butlast).last = phead ∨ (orl0 + phead ' + rl.butlast).last ∈ rl, ps0[(orl0 + phead ' + rl.butlast).last].deqID = vs0[(orl0 + phead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + phead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
Used terms: phead ', rl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| orl0 + phead ' + rl = rl1 + (orl0 + (phead ' + rl).butlast).last ' + ps0[(orl0 + (phead ' + rl).butlast).last].next ' + vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + (phead ' + rl).butlast).last].next = ps0[(orl0 + (phead ' + rl).butlast).last].next, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, ps0[(orl0 + (phead ' + rl).butlast).last].val = vs0[(orl0 + (phead ' + rl).butlast).last].val, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + (phead ' + rl).butlast).last) = None, owns0(ps0[(orl0 + (phead ' + rl).butlast).last].next) = None, rl = [], (orl0 + (phead ' + rl).butlast).last ≠ null, ps0[(orl0 + (phead ' + rl).butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next, node ≠ ps0[(orl0 + (phead ' + rl).butlast).last].next, node ≠ (orl0 + (phead ' + rl).butlast).last, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + (phead ' + rl).butlast).last ∈ vs0, (orl0 + (phead ' + rl).butlast).last ∈ ps0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ vs0, ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + (phead ' + rl).butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + (phead ' + rl).butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + (phead ' + rl).butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + (phead ' + rl).butlast).last ∈ orl0 ∨ (orl0 + (phead ' + rl).butlast).last = phead ∨ (orl0 + (phead ' + rl).butlast).last ∈ rl, ps0[(orl0 + (phead ' + rl).butlast).last].deqID = vs0[(orl0 + (phead ' + rl).butlast).last].deqID ∨ ps0[(orl0 + (phead ' + rl).butlast).last].deqID = None, ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = vs0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID ∨ ps0[ps0[(orl0 + (phead ' + rl).butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', vs0[phead].deqID = None, ps0[phead].deqID = None, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, vs0[orl0.last].next = ps0[orl0.last].next, vs0[phead].next = null, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[orl0.last].val = vs0[orl0.last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, owns0(ps0[orl0.last].next) = None, owns0(orl0.last) = None, owns0(node) = Some(tid), orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl2 + phead ', vs0, ps0, owns0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), ps0[orl0.last].next ∈ ps0, ps0[orl0.last].next ∈ vs0, orl0.last ∈ ps0, orl0.last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + y = z + y ↔ x = z; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ (x + a ').last = a; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ⊦ a ' + x ≠ []; (s) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| vs0[ps0[orl0.last].next].next ' + rl0 = rl2 + phead ', vs0[phead].deqID = None, ps0[phead].deqID = None, ps0[ps0[orl0.last].next].next = vs0[ps0[orl0.last].next].next, vs0[orl0.last].next = ps0[orl0.last].next, vs0[phead].next = null, ps0[ps0[orl0.last].next].val = vs0[ps0[orl0.last].next].val, ps0[orl0.last].val = vs0[orl0.last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl1 + orl0.last ' + ps0[orl0.last].next ' + rl2, owns0(ps0[orl0.last].next) = None, owns0(orl0.last) = None, owns0(node) = Some(tid), orl0.last ≠ null, ps0[orl0.last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[orl0.last].next].next, node ≠ ps0[orl0.last].next, node ≠ orl0.last, orl0 ≠ [], phead ≠ ps0[orl0.last].next, phead ≠ orl0.last, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl2 + phead ', vs0, ps0, owns0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), ps0[orl0.last].next ∈ ps0, ps0[orl0.last].next ∈ vs0, orl0.last ∈ ps0, orl0.last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0), ¬ weak?(vs0[orl0.last].deqID), ¬ weak?(vs0[ps0[orl0.last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ ps0[orl0.last].next ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vs0[ps0[orl0.last].next].next ∈ rl2 ∨ vs0[ps0[orl0.last].next].next = phead, phead ∈ rl0 ∨ phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl1, orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last, ps0[ps0[orl0.last].next].deqID = vs0[ps0[orl0.last].next].deqID ∨ ps0[ps0[orl0.last].next].deqID = None, ps0[orl0.last].deqID = vs0[orl0.last].deqID ∨ ps0[orl0.last].deqID = None, phead = vs0[ps0[orl0.last].next].next ∨ phead ∈ rl0 ⊦ |
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) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ' + x ≠ []; (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: orl0, vhead, y
| orl0 + phead ' + rl = rl1 + (orl0 + phead ' + rl.butlast).last ' + ps0[(orl0 + phead ' + rl.butlast).last].next ' + vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[(phead ' + rl).last].deqID = None, vs0[(phead ' + rl).last].next = null, vs0[(orl0 + phead ' + rl.butlast).last].next = ps0[(orl0 + phead ' + rl.butlast).last].next, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].next = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, ps0[(orl0 + phead ' + rl.butlast).last].val = vs0[(orl0 + phead ' + rl.butlast).last].val, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].val = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((orl0 + phead ' + rl.butlast).last) = None, owns0(ps0[(orl0 + phead ' + rl.butlast).last].next) = None, (orl0 + phead ' + rl.butlast).last ≠ null, ps0[(orl0 + phead ' + rl.butlast).last].next ≠ null, node ≠ null, node ≠ vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next, node ≠ ps0[(orl0 + phead ' + rl.butlast).last].next, node ≠ (orl0 + phead ' + rl.butlast).last, node ≠ phead, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (orl0 + phead ' + rl.butlast).last ∈ vs0, (orl0 + phead ' + rl.butlast).last ∈ ps0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ vs0, ps0[(orl0 + phead ' + rl.butlast).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(orl0 + phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(orl0 + phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (orl0 + phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (orl0 + phead ' + rl.butlast).last ∈ orl0 ∨ (orl0 + phead ' + rl.butlast).last = phead ∨ (orl0 + phead ' + rl.butlast).last ∈ rl, ps0[(orl0 + phead ' + rl.butlast).last].deqID = vs0[(orl0 + phead ' + rl.butlast).last].deqID ∨ ps0[(orl0 + phead ' + rl.butlast).last].deqID = None, ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = vs0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(orl0 + phead ' + rl.butlast).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl.butlast).last ' + ps0[(phead ' + rl.butlast).last].next ' + vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0[rl.last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl.butlast).last].next].next = vs0[ps0[(phead ' + rl.butlast).last].next].next, vs0[(phead ' + rl.butlast).last].next = ps0[(phead ' + rl.butlast).last].next, vs0[rl.last].next = null, ps0[ps0[(phead ' + rl.butlast).last].next].val = vs0[ps0[(phead ' + rl.butlast).last].next].val, ps0[(phead ' + rl.butlast).last].val = vs0[(phead ' + rl.butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl.butlast).last].next) = None, owns0((phead ' + rl.butlast).last) = None, owns0(node) = Some(tid), (phead ' + rl.butlast).last ≠ null, ps0[(phead ' + rl.butlast).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl.butlast).last].next].next, node ≠ ps0[(phead ' + rl.butlast).last].next, node ≠ (phead ' + rl.butlast).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl.butlast).last].next ∈ ps0, ps0[(phead ' + rl.butlast).last].next ∈ vs0, (phead ' + rl.butlast).last ∈ ps0, (phead ' + rl.butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(phead ' + rl.butlast).last].next].deqID = vs0[ps0[(phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(phead ' + rl.butlast).last].next].deqID = None, ps0[(phead ' + rl.butlast).last].deqID = vs0[(phead ' + rl.butlast).last].deqID ∨ ps0[(phead ' + rl.butlast).last].deqID = None, (phead ' + rl.butlast).last ∈ orl0 ∨ (phead ' + rl.butlast).last = phead ∨ (phead ' + rl.butlast).last ∈ rl ⊦
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)
| orl0 + phead ' + rl = rl1 + (phead ' + rl.butlast).last ' + ps0[(phead ' + rl.butlast).last].next ' + vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0[rl.last].deqID = None, ps0[phead].deqID = None, ps0[ps0[(phead ' + rl.butlast).last].next].next = vs0[ps0[(phead ' + rl.butlast).last].next].next, vs0[(phead ' + rl.butlast).last].next = ps0[(phead ' + rl.butlast).last].next, vs0[rl.last].next = null, ps0[ps0[(phead ' + rl.butlast).last].next].val = vs0[ps0[(phead ' + rl.butlast).last].next].val, ps0[(phead ' + rl.butlast).last].val = vs0[(phead ' + rl.butlast).last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[(phead ' + rl.butlast).last].next) = None, owns0((phead ' + rl.butlast).last) = None, owns0(node) = Some(tid), (phead ' + rl.butlast).last ≠ null, ps0[(phead ' + rl.butlast).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl.butlast).last].next].next, node ≠ ps0[(phead ' + rl.butlast).last].next, node ≠ (phead ' + rl.butlast).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), listp(vs0[ps0[(phead ' + rl.butlast).last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[(phead ' + rl.butlast).last].next ∈ ps0, ps0[(phead ' + rl.butlast).last].next ∈ vs0, (phead ' + rl.butlast).last ∈ ps0, (phead ' + rl.butlast).last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl.butlast).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl.butlast).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl.butlast).last].next ∈ orl0 + phead ' + rl from (phead ' + rl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0), ps0[ps0[(phead ' + rl.butlast).last].next].deqID = vs0[ps0[(phead ' + rl.butlast).last].next].deqID ∨ ps0[ps0[(phead ' + rl.butlast).last].next].deqID = None, ps0[(phead ' + rl.butlast).last].deqID = vs0[(phead ' + rl.butlast).last].deqID ∨ ps0[(phead ' + rl.butlast).last].deqID = None, (phead ' + rl.butlast).last ∈ orl0 ∨ (phead ' + rl.butlast).last = phead ∨ (phead ' + rl.butlast).last ∈ rl ⊦ |
orl0 + phead ' + rl = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, rl = rl2 + vhead ', (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ ps0[(phead ' + rl2).last].next, node ≠ (phead ' + rl2).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl, ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl, vhead, y
| orl0 + phead ' + rl = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, rl = rl2 + vhead ', (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ ps0[(phead ' + rl2).last].next, node ≠ (phead ' + rl2).last, orl0 ≠ [], rl ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl, ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ⊦ |
orl0 + phead ' + rl2 + vhead ' = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ vhead, node ≠ (phead ' + rl2).last, node ≠ ps0[(phead ' + rl2).last].next, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl2 + vhead ' from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl2 ∨ (phead ' + rl2).last = vhead, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, vhead ∈ rl1 ∨ vhead = (phead ' + rl2).last ∨ vhead = ps0[(phead ' + rl2).last].next ∨ vhead = vs0[ps0[(phead ' + rl2).last].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (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)
| orl0 + phead ' + rl2 + vhead ' = rl1 + (phead ' + rl2).last ' + ps0[(phead ' + rl2).last].next ' + vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[(phead ' + rl2).last].next = ps0[(phead ' + rl2).last].next, ps0[ps0[(phead ' + rl2).last].next].next = vs0[ps0[(phead ' + rl2).last].next].next, ps0[(phead ' + rl2).last].val = vs0[(phead ' + rl2).last].val, ps0[ps0[(phead ' + rl2).last].next].val = vs0[ps0[(phead ' + rl2).last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0((phead ' + rl2).last) = None, owns0(ps0[(phead ' + rl2).last].next) = None, (phead ' + rl2).last ≠ null, ps0[(phead ' + rl2).last].next ≠ null, node ≠ vhead, node ≠ (phead ' + rl2).last, node ≠ ps0[(phead ' + rl2).last].next, node ≠ vs0[ps0[(phead ' + rl2).last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[(phead ' + rl2).last].next].next ' + rl0, vs0, ps0, owns0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, (phead ' + rl2).last ∈ vs0, (phead ' + rl2).last ∈ ps0, ps0[(phead ' + rl2).last].next ∈ vs0, ps0[(phead ' + rl2).last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[(phead ' + rl2).last].next].deqID), ¬ weak?(vs0[(phead ' + rl2).last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[(phead ' + rl2).last].next ∈ orl0 + phead ' + rl2 + vhead ' from (phead ' + rl2).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (phead ' + rl2).last ∈ orl0 ∨ (phead ' + rl2).last = phead ∨ (phead ' + rl2).last ∈ rl2 ∨ (phead ' + rl2).last = vhead, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[(phead ' + rl2).last].deqID = vs0[(phead ' + rl2).last].deqID ∨ ps0[(phead ' + rl2).last].deqID = None, ps0[ps0[(phead ' + rl2).last].next].deqID = vs0[ps0[(phead ' + rl2).last].next].deqID ∨ ps0[ps0[(phead ' + rl2).last].next].deqID = None, vhead ∈ rl1 ∨ vhead = (phead ' + rl2).last ∨ vhead = ps0[(phead ' + rl2).last].next ∨ vhead = vs0[ps0[(phead ' + rl2).last].next].next ∨ vhead ∈ rl0 ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl2 + vhead ' = rl1 + rl2.last ' + ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, vs0[rl2.last].next = ps0[rl2.last].next, vs0[vhead].next = null, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[rl2.last].val = vs0[rl2.last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl2.last].next) = None, owns0(rl2.last) = None, owns0(node) = Some(tid), rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[rl2.last].next ∈ ps0, ps0[rl2.last].next ∈ vs0, rl2.last ∈ ps0, rl2.last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ orl0 + phead ' + rl2 + vhead ' from rl2.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ∈ rl1 ∨ vhead = rl2.last ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), rl2.last ∈ orl0 ∨ rl2.last = phead ∨ rl2.last ∈ rl2 ∨ rl2.last = vhead ⊦
Used simplifier rules: ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) lapp-04: ⊦ a ' + x = y + b ' ∧ a ≠ b → x.last = b; (forward) from specification list-last[reflist] inapp-10: ⊦ a ' + x = y + b ' ∧ a ≠ b → a ∈ y ∧ b ∈ x; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (x + a ').last = a; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ ¬ a ∈ x → (x + a ' = y + a ' + z ↔ y = x ∧ z = []); (ws) ⊦ a ∈ x → a ∈ x + y; (s) ⊦ a ∈ y → a ∈ x + y; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + y = z + y ↔ x = z; (s) ⊦ x = y + x ↔ y = []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: phead ', rl2
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl2 + vhead ' = rl1 + rl2.last ' + ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, vs0[rl2.last].next = ps0[rl2.last].next, vs0[vhead].next = null, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, ps0[rl2.last].val = vs0[rl2.last].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[rl2.last].next) = None, owns0(rl2.last) = None, owns0(node) = Some(tid), rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[rl2.last].next ∈ ps0, ps0[rl2.last].next ∈ vs0, rl2.last ∈ ps0, rl2.last ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ orl0 + phead ' + rl2 + vhead ' from rl2.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead ∈ rl1 ∨ vhead = rl2.last ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), rl2.last ∈ orl0 ∨ rl2.last = phead ∨ rl2.last ∈ rl2 ∨ rl2.last = vhead ⊦ |
orl0 + phead ' + rl2 = rl1 + rl2.last ' + orl, ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0 = orl + vhead ', ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[rl2.last].next = ps0[rl2.last].next, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, ps0[rl2.last].val = vs0[rl2.last].val, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl2.last) = None, owns0(ps0[rl2.last].next) = None, rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ rl2.last, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + rl2.last ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + rl2.last ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + rl2.last ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, rl2.last ∈ vs0, rl2.last ∈ ps0, ps0[rl2.last].next ∈ vs0, ps0[rl2.last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ rl1 + rl2.last ' + orl + vhead ' from rl2.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[rl2.last].next ∈ orl ∨ ps0[rl2.last].next = vhead, vhead ∈ rl1 ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, vhead ∈ rl0 ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead = ps0[rl2.last].next ∨ vhead ∈ rl1, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + y = z + y ↔ x = z; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s)
| orl0 + phead ' + rl2 = rl1 + rl2.last ' + orl, ps0[rl2.last].next ' + vs0[ps0[rl2.last].next].next ' + rl0 = orl + vhead ', ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, vs0[vhead].next = null, vs0[rl2.last].next = ps0[rl2.last].next, ps0[ps0[rl2.last].next].next = vs0[ps0[rl2.last].next].next, ps0[rl2.last].val = vs0[rl2.last].val, ps0[ps0[rl2.last].next].val = vs0[ps0[rl2.last].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(rl2.last) = None, owns0(ps0[rl2.last].next) = None, rl2.last ≠ null, ps0[rl2.last].next ≠ null, node ≠ vhead, node ≠ rl2.last, node ≠ ps0[rl2.last].next, node ≠ vs0[ps0[rl2.last].next].next, node ≠ null, node ≠ phead, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ rl2.last, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[rl2.last].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + rl2.last ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + rl2.last ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + rl2.last ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl2, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, rl2.last ∈ vs0, rl2.last ∈ ps0, ps0[rl2.last].next ∈ vs0, ps0[rl2.last].next ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[rl2.last].next].deqID), ¬ weak?(vs0[rl2.last].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[rl2.last].next ∈ rl1 + rl2.last ' + orl + vhead ' from rl2.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[rl2.last].next ∈ orl ∨ ps0[rl2.last].next = vhead, vhead ∈ rl1 ∨ vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0, vhead ∈ rl0 ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead = ps0[rl2.last].next ∨ vhead ∈ rl1, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), ps0[rl2.last].deqID = vs0[rl2.last].deqID ∨ ps0[rl2.last].deqID = None, ps0[ps0[rl2.last].next].deqID = vs0[ps0[rl2.last].next].deqID ∨ ps0[ps0[rl2.last].next].deqID = None, vhead = ps0[rl2.last].next ∨ vhead = vs0[ps0[rl2.last].next].next ∨ vhead ∈ rl0 ⊦ |
ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl2 = rl1 + node0 ' + orl, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl2 = rl + node0 ', ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, ps0[node0].deqID = vs0[node0].deqID ∨ ps0[node0].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), vhead ∈ rl0 ∨ vhead = vs0[ps0[node0].next].next ∨ vhead = ps0[node0].next ∨ vhead ∈ rl1, vhead ∈ rl1 ∨ vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, node0, y
| ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl2 = rl1 + node0 ' + orl, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl2 = rl + node0 ', ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, rl2 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl2, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl2), ¬ dups(orl0), ¬ dups(orl0 + rl2), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ node ∈ rl2, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl2, ¬ node ∈ rl0, ¬ vhead ∈ rl2, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, ps0[node0].deqID = vs0[node0].deqID ∨ ps0[node0].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl2, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl2, vs0), vhead ∈ rl0 ∨ vhead = vs0[ps0[node0].next].next ∨ vhead = ps0[node0].next ∨ vhead ∈ rl1, vhead ∈ rl1 ∨ vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦ |
ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[node0].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0 ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) 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 inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)
| ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 = orl + vhead ', orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[node0].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, ps0[vhead].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[vhead].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0 ⊦ |
y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = (ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0).butlast, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, vhead = (ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0).last, ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 ≠ [], ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦
Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, orl, vhead
| y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last |
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + orl, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = (ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0).butlast, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, vhead = (ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0).last, ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 ≠ [], ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + orl + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + orl + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + orl + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + orl + vhead ' from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vhead = ps0[node0].next ∨ vhead = vs0[ps0[node0].next].next ∨ vhead ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[node0].next ∈ orl ∨ ps0[node0].next = vhead ⊦ |
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + (vs0[ps0[node0].next].next ' + rl0).butlast, ps0[(vs0[ps0[node0].next].next ' + rl0).last].deqID = None, ps0[phead].deqID = None, vs0[(vs0[ps0[node0].next].next ' + rl0).last].deqID = None, ps0[node0].deqID = None, vs0[(vs0[ps0[node0].next].next ' + rl0).last].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, (vs0[ps0[node0].next].next ' + rl0).last ≠ node0, ps0[node0].next ≠ null, node ≠ (vs0[ps0[node0].next].next ' + rl0).last, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ (vs0[ps0[node0].next].next ' + rl0).last, phead ≠ node0, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl1, ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (vs0[ps0[node0].next].next ' + rl0).last = ps0[node0].next ∨ (vs0[ps0[node0].next].next ' + rl0).last = vs0[ps0[node0].next].next ∨ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) x ≠ [] ⊦ x.butlast + x.last ' = x; (s) ⊦ a ' + x ≠ []; (s)
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + (vs0[ps0[node0].next].next ' + rl0).butlast, ps0[(vs0[ps0[node0].next].next ' + rl0).last].deqID = None, ps0[phead].deqID = None, vs0[(vs0[ps0[node0].next].next ' + rl0).last].deqID = None, ps0[node0].deqID = None, vs0[(vs0[ps0[node0].next].next ' + rl0).last].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, (vs0[ps0[node0].next].next ' + rl0).last ≠ node0, ps0[node0].next ≠ null, node ≠ (vs0[ps0[node0].next].next ' + rl0).last, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ (vs0[ps0[node0].next].next ' + rl0).last, phead ≠ node0, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl1, ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), (vs0[ps0[node0].next].next ' + rl0).last = ps0[node0].next ∨ (vs0[ps0[node0].next].next ' + rl0).last = vs0[ps0[node0].next].next ∨ (vs0[ps0[node0].next].next ' + rl0).last ∈ rl0, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + (vs0[ps0[node0].next].next ' + rl0).butlast, ps0[node0].deqID = None, vs0[rl0.last].deqID = None, ps0[phead].deqID = None, ps0[rl0.last].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[rl0.last].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl0.last ≠ node0, ps0[node0].next ≠ null, node ≠ rl0.last, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ rl0.last, phead ≠ node0, rl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ rl0.last ∈ rl1, ¬ rl0.last ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ rl0.last ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, rl0.last = ps0[node0].next ∨ rl0.last = vs0[ps0[node0].next].next ∨ rl0.last ∈ rl0 ⊦
Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ 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) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs0[ps0[node0].next].next ', rl0
| ⊦ y ≠ [] → (x + y).last = y.last |
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + (vs0[ps0[node0].next].next ' + rl0).butlast, ps0[node0].deqID = None, vs0[rl0.last].deqID = None, ps0[phead].deqID = None, ps0[rl0.last].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[rl0.last].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl0.last ≠ node0, ps0[node0].next ≠ null, node ≠ rl0.last, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ rl0.last, phead ≠ node0, rl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ rl0.last ∈ rl1, ¬ rl0.last ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, ¬ node ∈ rl0, ¬ rl0.last ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, rl0.last = ps0[node0].next ∨ rl0.last = vs0[ps0[node0].next].next ∨ rl0.last ∈ rl0 ⊦ |
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0.butlast, ps0[node0].deqID = None, vs0[rl0.last].deqID = None, ps0[phead].deqID = None, ps0[rl0.last].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[rl0.last].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl0.last ≠ node0, ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ rl0.last, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ rl0.last ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ rl0.last ∈ orl0, ¬ rl0.last ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s)
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0.butlast, ps0[node0].deqID = None, vs0[rl0.last].deqID = None, ps0[phead].deqID = None, ps0[rl0.last].deqID = None, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, vs0[node0].next = ps0[node0].next, vs0[rl0.last].next = null, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, ps0[node0].val = vs0[node0].val, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(ps0[node0].next) = None, owns0(node0) = None, owns0(node) = Some(tid), rl0.last ≠ node0, ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ rl0.last, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ rl0.last, rl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), ps0[node0].next ∈ ps0, ps0[node0].next ∈ vs0, node0 ∈ ps0, node0 ∈ vs0, vhead0 ∈ orl0, phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, vhead0 ∈ vs0, vhead0 ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ rl0.last ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ rl0.last ∈ orl0, ¬ rl0.last ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None, ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None ⊦ |
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, rl0 = rl2 + vhead ', ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, rl0 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl0, vhead, y
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, rl0 = rl2 + vhead ', ps0[node0].next ≠ null, node ≠ phead, node ≠ null, node ≠ vs0[ps0[node0].next].next, node ≠ ps0[node0].next, node ≠ node0, node ≠ vhead, node0 ≠ null, orl0 ≠ [], phead ≠ node0, phead ≠ vhead, rl0 ≠ [], tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ weak?(vs0[node0].deqID), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ vhead ∈ rl, ¬ node ∈ rl0, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node ∈ rl1, ¬ node ∈ orl0, ¬ node ∈ rl, ¬ node0 ∈ orl0, ¬ node0 ∈ rl, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl0 from node0, ¬ vhead ∈ orl0, ¬ vhead ∈ rl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦ |
orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, phead ≠ node0, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ node ∈ rl2, ¬ vhead ∈ rl, ¬ vhead ∈ rl1, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ' from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦
Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s)
| orl0 + phead ' + rl + node0 ' = rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2, ps0[vhead].deqID = None, ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[node0].deqID = None, vs0[vhead].next = null, vs0[node0].next = ps0[node0].next, ps0[ps0[node0].next].next = vs0[ps0[node0].next].next, ps0[node0].val = vs0[node0].val, ps0[ps0[node0].next].val = vs0[ps0[node0].next].val, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), owns0(node0) = None, owns0(ps0[node0].next) = None, ps0[node0].next ≠ null, node ≠ vhead, node ≠ node0, node ≠ ps0[node0].next, node ≠ vs0[ps0[node0].next].next, node ≠ null, node ≠ phead, node0 ≠ null, orl0 ≠ [], phead ≠ vhead, phead ≠ node0, tid ≠ tid0, vhead ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, ps0, owns0), listp(vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vhead0, vs0), nonullRetRefs(rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(rl, ps0), vhead0 ∈ ps0, vhead0 ∈ vs0, phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, vhead0 ∈ orl0, node0 ∈ vs0, node0 ∈ ps0, ps0[node0].next ∈ vs0, ps0[node0].next ∈ ps0, ¬ dups(orl0 + rl), ¬ dups(orl0), ¬ dups(rl), ¬ weak?(vs0[ps0[node0].next].deqID), ¬ weak?(vs0[node0].deqID), ¬ node ∈ rl2, ¬ vhead ∈ rl, ¬ vhead ∈ rl1, ¬ vhead ∈ orl0, ¬ ps0[node0].next ∈ rl1 + node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ' from node0, ¬ node0 ∈ rl, ¬ node0 ∈ orl0, ¬ node ∈ rl, ¬ node ∈ orl0, ¬ node ∈ rl1, ¬ phead ∈ orl0, ¬ phead ∈ rl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), ps0[ps0[node0].next].deqID = vs0[ps0[node0].next].deqID ∨ ps0[ps0[node0].next].deqID = None, orl0.last = vhead0 ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(rl, vs0) ∧ vs0[node0].deqID = None ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ 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) Used terms: rl1, node0 ' + ps0[node0].next ' + vs0[ps0[node0].next].next ' + rl2 + vhead ', node0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
| vs[lst].next = ps[lst].next, vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), owns(node) = Some(tid), ps[lst].next ≠ null, node ≠ null, orl ≠ [], tid ≠ tid0, vtail ≠ lst, 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), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ 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, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (∃ rl. orl + qrl + rl = orl0 + qrl0) ∧ (∃ rl0. orl + rl0 = orl0) ∧ vtail0 ∈ orl0 + qrl0 from vtail ∧ phead0 ∈ orl0 + qrl0 from phead ∧ vhead0 ∈ orl0 + qrl0 from vhead ∧ equalrl(orl + qrl, vs, ps, vs0, ps0) ∧ equalowns(vs, ps, owns, tid0, vs0, ps0, owns0) ∧ vretRefs(tid0) = vretRefs0(tid0) ∧ (pretRefs(tid0) = pretRefs0(tid0) ∨ vretRefs(tid0) = pretRefs0(tid0)) ∧ rvownsrely(tid0, rvowns, rvowns0, vrvHp) ∧ rvrely(tid0, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0) ∧ dom prvHp ⊆ dom vrvHp0 ∧ prvHpRely(vrvHp, prvHp, prvHp0) ∧ noidRely(tid0, orl + qrl, vs, orl0 + qrl0, vs0) ∧ nextnottidRely(tid0, vhead, vs, vhead0, vs0) ∧ ownsRely(tid0, owns, owns0) |
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0
Used simplifier rules: ⊦ # s = # s0 → (s ⊆ s0 ↔ s = s0); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ ownsRely(tid, owns, owns); (s) ⊦ nextnottidRely(tid, vhead, vs, vhead, vs); (s) ⊦ noidRely(tid, rl, vs, rl, vs); (s) ⊦ prvHpRely(vrvHp, prvHp, prvHp); (s) ⊦ rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs, vrvHp); (s) ⊦ rvownsrely(tid, rvowns, rvowns, vrvHp); (s) ⊦ equalowns(vs, ps, owns, tid, vs, ps, owns); (s) ⊦ equalrl(rl, vs, ps, vs, ps); (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ x = x + y ↔ y = []; (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws)
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vtail0 ∈ orl0 + qrl0 from vtail0 ∧ vhead0 ∈ orl0 + qrl0 from vhead0 |
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vtail0 ∈ orl0 + qrl0 from vtail0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, (orl0 + qrl0.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦
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)
| vs0[qrl0.last].deqID = None, vs0[qrl0.last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + qrl0.butlast).last ≠ qrl0.last, (orl0 + qrl0.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0 ⊦ |
vs0[qrl0.last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), qrl0 = phead + orl, (orl0 + qrl0.butlast).last ≠ qrl0.last, (orl0 + qrl0.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦
Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl0, head, tail
| vs0[qrl0.last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[qrl0.last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), qrl0 = phead + orl, (orl0 + qrl0.butlast).last ≠ qrl0.last, (orl0 + qrl0.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], qrl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ (orl0 + qrl0.butlast).last ∈ orl0 + qrl0 from (orl0 + qrl0.butlast).last, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦
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) ⊦ 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)
| vs0[(phead ' + orl).last].deqID = None, ps0[phead].deqID = None, vs0[(phead ' + orl).last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ |
⊦ y ≠ [] → (x + y).butlast = x + y.butlast
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = [], owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (orl0 + phead ' + orl.butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used terms: phead ', orl
| ⊦ y ≠ [] → (x + y).butlast = x + y.butlast |
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = [], owns0(node) = Some(tid), (orl0 + (phead ' + orl).butlast).last ≠ (phead ' + orl).last, (orl0 + (phead ' + orl).butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + (phead ' + orl).butlast).last ∈ orl0 + phead ' + orl from (orl0 + (phead ' + orl).butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl0.last ≠ phead, orl0.last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0), ¬ node ∈ orl0, ¬ phead ∈ orl0, ¬ orl0.last ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last, lst ∈ orl0 ∨ lst = phead ⊦
Used simplifier rules: ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ a '.last = a; (s)
| ps0[phead].deqID = None, vs0[phead].deqID = None, vs0[phead].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl0.last ≠ phead, orl0.last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ', vhead0, vs0), nonullRetRefs(orl0 + phead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0), ¬ node ∈ orl0, ¬ phead ∈ orl0, ¬ orl0.last ∈ orl0 + phead ' from orl0.last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last, lst ∈ orl0 ∨ lst = phead ⊦ |
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: orl0, vhead, y
| ps0[phead].deqID = None, vs0[(phead ' + orl).last].deqID = None, vs0[lst].next = ps0[lst].next, vs0[(phead ' + orl).last].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (orl0 + phead ' + orl.butlast).last ≠ (phead ' + orl).last, (orl0 + phead ' + orl.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (orl0 + phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (orl0 + phead ' + orl.butlast).last, ¬ node ∈ orl0, ¬ node ∈ orl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (phead ' + orl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦
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)
| ps0[phead].deqID = None, vs0[orl.last].deqID = None, vs0[orl.last].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl.butlast).last ≠ orl.last, (phead ' + orl.butlast).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl.butlast).last ∈ orl0 + phead ' + orl from (phead ' + orl.butlast).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl ⊦ |
vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl from (phead ' + orl1).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl, vhead, y
| vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl = orl1 + vhead ', owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, orl ≠ [], orl0 ≠ [], tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl, vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl), ¬ dups(orl0), ¬ dups(orl), ¬ node ∈ orl0, ¬ node ∈ orl, ¬ phead ∈ orl, ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl from (phead ' + orl1).last, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl, orl0.last = vhead0 ∧ unmarkedp(orl, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl, vs0) ⊦ |
ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from (phead ' + orl1).last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead ⊦
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)
| ps0[phead].deqID = None, vs0[vhead].deqID = None, ps0[vhead].deqID = None, vs0[vhead].next = null, vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), (phead ' + orl1).last ≠ vhead, (phead ' + orl1).last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ (phead ' + orl1).last ∈ orl0 + phead ' + orl1 + vhead ' from (phead ' + orl1).last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead ⊦ |
⊦ y ≠ [] → (x + y).last = y.last
ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl1.last ≠ vhead, orl1.last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ orl1.last ∈ orl0 + phead ' + orl1 + vhead ' from orl1.last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦
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: phead ', orl1
| ⊦ y ≠ [] → (x + y).last = y.last |
| ps0[vhead].deqID = None, vs0[vhead].deqID = None, ps0[phead].deqID = None, vs0[lst].next = ps0[lst].next, vs0[vhead].next = null, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), orl1.last ≠ vhead, orl1.last ≠ lst, ps0[lst].next ≠ null, node ≠ null, node ≠ phead, node ≠ vhead, orl0 ≠ [], orl1 ≠ [], phead ≠ vhead, tid ≠ tid0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + phead ' + orl1 + vhead ', vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + phead ' + orl1 + vhead ', vhead0, vs0), nonullRetRefs(orl0 + phead ' + orl1 + vhead ', vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(orl1, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(orl0 + orl1), ¬ dups(orl0), ¬ dups(orl1), ¬ phead ∈ orl0, ¬ orl1.last ∈ orl0 + phead ' + orl1 + vhead ' from orl1.last, ¬ vhead ∈ orl0, ¬ vhead ∈ orl1, ¬ node ∈ orl0, ¬ node ∈ orl1, ¬ phead ∈ orl1, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), lst ∈ orl0 ∨ lst = phead ∨ lst ∈ orl1 ∨ lst = vhead, orl0.last = vhead0 ∧ unmarkedp(orl1, vs0) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs0[phead].deqID = None ∧ unmarkedp(orl1, vs0) ⊦ |
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, node0, y
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, ps0), markedp(orl0, vs0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ orl0 ∨ lst ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0) ⊦ |
vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = qrl + phead ', owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦
Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, phead, y
| vs0[lst].next = ps0[lst].next, ps0[node] = mk(value, None, null), vs0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, orl0 = qrl + phead ', owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, orl0 ≠ [], tid ≠ tid0, vtail0 ≠ lst, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs0, ps0, owns0), markedp(orl0, vs0), markedp(orl0, ps0), nextnottid(tid, vhead0, vs0), noid(tid, orl0 + qrl0, vhead0, vs0), nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, node ∈ vs0, node ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ vhead0 ∈ orl0 + qrl0 from vhead0, ¬ node ∈ orl0, ¬ node ∈ qrl0, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs0), lst ∈ orl0 ∨ lst ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ |
vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ phead, tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((qrl + phead ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (qrl + phead ') + qrl0, vhead0, vs0), nonullRetRefs((qrl + phead ') + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), unmarkedp(qrl0, ps0), node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ phead ∈ qrl, ¬ phead ∈ qrl0, ¬ vhead0 ∈ (qrl + phead ') + qrl0 from vhead0, ¬ node ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs0), phead0 ∈ qrl ∨ phead0 = phead, vtail0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl ∨ lst = phead ∨ lst ∈ qrl0 ⊦
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) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ 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)
| vs0[lst].next = ps0[lst].next, vs0[node] = mk(value, None, null), ps0[node] = mk(value, None, null), dom vrvHp0 = dom prvHp0, owns0(node) = Some(tid), ps0[lst].next ≠ null, node ≠ null, node ≠ phead, tid ≠ tid0, vtail0 ≠ lst, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((qrl + phead ') + qrl0, vs0, ps0, owns0), markedp(qrl, ps0), markedp(qrl, vs0), nextnottid(tid, vhead0, vs0), noid(tid, (qrl + phead ') + qrl0, vhead0, vs0), nonullRetRefs((qrl + phead ') + qrl0, vs0, vretRefs0, pretRefs0), oneowns(tid, node, owns0, vs0, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs0[phead].deqID), unmarkedp(qrl0, ps0), node ∈ ps0, node ∈ vs0, phead0 ∈ vs0, phead0 ∈ ps0, ¬ dups(qrl + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ node ∈ qrl0, ¬ phead ∈ qrl, ¬ phead ∈ qrl0, ¬ vhead0 ∈ (qrl + phead ') + qrl0 from vhead0, ¬ node ∈ qrl, vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ qrl ≠ [] ∧ qrl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs0), phead0 ∈ qrl ∨ phead0 = phead, vtail0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (phead ' + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst ∈ qrl ∨ lst = phead ∨ lst ∈ qrl0 ⊦ |
⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl
Used simplifier rules: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ rl → r ∈ rl from r; (ss) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r0 ≠ r → r0 ' + rl from r = rl from r; (s) ⊦ x.last = a ∧ x ≠ [] → a ∈ x; (s) Used terms: qrl + phead ', qrl0, vhead0
| ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl |
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.