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



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 1 from proof stable-E11 (conclusion) (back to tree)

⊦ ( ( ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ ( ls.success ∧ gs.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs.vs[ls.node].val = ls.value ∧ ( ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns))) ∧ listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns) ∧ ¬ dups(gs0.orl + gs0.qrl) ∧ markedp(gs0.orl, gs0.ps) ∧ markedp(gs0.orl, gs0.vs) ∧ unmarkedp(gs0.qrl, gs0.ps) ∧ gs0.orl ≠ [] ∧ gs0.phead ∈ gs0.orl ∧ rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns) ∧ allocrv(gs0.vretRefs, gs0.vrvHp) ∧ nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs) ∧ rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns) ∧ allocrv(gs0.pretRefs, gs0.prvHp) ∧ dom gs0.vrvHp = dom gs0.prvHp ∧ ( gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val)) ∧ ( gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs)) ∧ ( gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null)) ∧ (∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl) ∧ (∃ rl0. gs.orl + rl0 = gs0.orl) ∧ gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail ∧ gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead ∧ gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead ∧ equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps) ∧ equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns) ∧ gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid) ∧ (gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid)) ∧ rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp) ∧ rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp) ∧ dom gs.vrvHp ⊆ dom gs0.vrvHp ∧ prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp) ∧ noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs) ∧ nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs) ∧ ownsRely(ls.tid, gs.owns, gs0.owns) → ( ls.success ∧ gs0.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.ps[ls.lst].next = ls.node)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns))

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof stable-E11 (previous step) (back to tree)

gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs.vrvHp = dom gs.prvHp, dom gs0.vrvHp = dom gs0.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], ls.success, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs.qrl, gs.ps), unmarkedp(gs0.qrl, gs0.ps), gs.phead ∈ gs.orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, dom gs.vrvHp ⊆ dom gs0.vrvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), (gs.ps[ls.lst].next ≠ gs.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), ∃ rl. gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, ∃ rl0. gs.orl + rl0 = gs0.orl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null, ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs.orl + gs.qrl ∧ gs.ps[ls.lst].next = ls.node, gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[(gs0.orl + gs0.qrl).last].next = null, gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ ( ls.success ∧ gs0.vs[ls.lst].next = ls.node ∧ ls.node ≠ null ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ ls.lst ∈ gs0.orl + gs0.qrl ∧ gs0.ps[ls.lst].next = ls.node)) ∧ nextnottid(ls.tid, gs0.vhead, gs0.vs) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ⊦ nextnottidRely(tid, vhead, vs, vhead0, vs0) ∧ nextnottid(tid, vhead, vs) → nextnottid(tid, vhead0, vs0); (ss) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 3 from proof stable-E11 (previous step) (back to tree)

gs.orl + rl0 = gs0.orl, gs.orl + gs.qrl + rl = gs0.orl + gs0.qrl, gs.vs[ls.lst].next = ls.node, gs.vs[ls.node].val = ls.value, gs.vretRefs(ls.tid) = gs0.vretRefs(ls.tid), dom gs0.vrvHp = dom gs0.prvHp, dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs0.orl ≠ [], gs.orl ≠ [], ls.success, allocrv(gs0.pretRefs, gs0.prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), equalowns(gs.vs, gs.ps, gs.owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(gs.orl + gs.qrl, gs.vs, gs.ps, gs0.vs, gs0.ps), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs0.orl, gs0.vs), markedp(gs0.orl, gs0.ps), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), nextnottid(ls.tid, gs.vhead, gs.vs), nextnottidRely(ls.tid, gs.vhead, gs.vs, gs0.vhead, gs0.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), noidRely(ls.tid, gs.orl + gs.qrl, gs.vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), ownsRely(ls.tid, gs.owns, gs0.owns), prvHpRely(gs.vrvHp, gs.prvHp, gs0.prvHp), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownsrely(ls.tid, gs.rvowns, gs0.rvowns, gs.vrvHp), rvrely(ls.tid, gs.rvowns, gs.vretRefs, gs.vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(gs0.qrl, gs0.ps), unmarkedp(gs.qrl, gs.ps), gs0.vhead ∈ gs0.orl + gs0.qrl from gs.vhead, gs0.phead ∈ gs0.orl + gs0.qrl from gs.phead, gs0.vtail ∈ gs0.orl + gs0.qrl from gs.vtail, gs0.phead ∈ gs0.orl, gs.phead ∈ gs.orl, gs0.phead ∈ gs0.vs, gs0.phead ∈ gs0.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.ps, dom gs.prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), ¬ dups(gs0.orl), ¬ dups(gs0.qrl), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), (gs.ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps);noowns(ls.tid, gs.owns)), gs.pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), 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), gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, ls.lst = gs.vtail ∧ gs.ps[ls.lst].next = null ∧ gs.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl) ∧ gs.ps[ls.lst].next = ls.node, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null ⊦ gs0.vs[ls.lst].next = ls.node ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs0.orl ∨ ls.lst ∈ gs0.qrl) ∧ gs0.ps[ls.lst].next = ls.node) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs]

Additional information

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

Proof step 4 from proof stable-E11 (previous step) (back to tree)

orl + qrl + rl = gs0.orl + gs0.qrl, orl + rl0 = gs0.orl, vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), vretRefs(ls.tid) = gs0.vretRefs(ls.tid), ls.node ≠ null, gs0.orl ≠ [], orl ≠ [], ls.success, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp(gs0.orl + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(gs0.orl, gs0.ps), markedp(gs0.orl, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, gs0.orl + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs(gs0.orl + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), phead ∈ ps, phead ∈ vs, gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.phead ∈ gs0.orl, gs0.vtail ∈ gs0.orl + gs0.qrl from vtail, gs0.phead ∈ gs0.orl + gs0.qrl from phead, gs0.vhead ∈ gs0.orl + gs0.qrl from vhead, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.orl + gs0.qrl), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ dups(gs0.orl), ¬ dups(gs0.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), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, gs0.vtail = (gs0.orl + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = (gs0.orl + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), gs0.orl.last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ gs0.orl.butlast ≠ [] ∧ gs0.orl.butlast.last = gs0.vhead ∧ gs0.phead ≠ gs0.orl.last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid) ⊦ gs0.vs[ls.lst].next = ls.node ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ gs0.orl ∨ ls.lst ∈ gs0.qrl) ∧ gs0.ps[ls.lst].next = ls.node) ∧ noid(ls.tid, gs0.orl + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ # x = # z → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) 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

Proof step 5 from proof stable-E11 (previous step) (back to tree)

orl + rl0 = gs0.orl, qrl + rl = rl0 + gs0.qrl, vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, dom gs0.vrvHp = dom gs0.prvHp, vretRefs(ls.tid) = gs0.vretRefs(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], ls.success, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(gs0.vretRefs, gs0.vrvHp), allocrv(gs0.pretRefs, gs0.prvHp), equalowns(vs, ps, owns, ls.tid, gs0.vs, gs0.ps, gs0.owns), equalrl(orl + qrl, vs, ps, gs0.vs, gs0.ps), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + gs0.qrl, gs0.vs, gs0.ps, gs0.owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, gs0.ps), markedp(rl0, gs0.ps), markedp(orl, gs0.vs), markedp(rl0, gs0.vs), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, gs0.vhead, gs0.vs), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + gs0.qrl, gs0.vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + gs0.qrl, gs0.vs, gs0.vretRefs, gs0.pretRefs), ownsRely(ls.tid, owns, gs0.owns), prvHpRely(vrvHp, prvHp, gs0.prvHp), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(gs0.vretRefs, gs0.vrvHp, gs0.rvowns), rvownerok(gs0.pretRefs, gs0.prvHp, gs0.rvowns), rvownsrely(ls.tid, rvowns, gs0.rvowns, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, gs0.vretRefs, gs0.vrvHp), unmarkedp(qrl, ps), unmarkedp(gs0.qrl, gs0.ps), gs0.phead ∈ gs0.ps, gs0.phead ∈ gs0.vs, phead ∈ orl, gs0.vtail ∈ (orl + rl0) + gs0.qrl from vtail, gs0.vhead ∈ (orl + rl0) + gs0.qrl from vhead, phead ∈ ps, phead ∈ vs, phead ∈ gs0.ps, phead ∈ gs0.vs, dom prvHp ⊆ dom gs0.prvHp, ¬ dups(gs0.qrl), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + gs0.qrl), ¬ dups(qrl), ¬ dups(rl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), gs0.vs[gs0.vhead].next ≠ null ∧ gs0.vs[gs0.vs[gs0.vhead].next].deqID ≠ None → gs0.rvowns(gs0.vretRefs(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid)) = Claimed(gs0.vs[gs0.vs[gs0.vhead].next].deqID.tid, gs0.vs[gs0.vs[gs0.vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, gs0.vtail = ((orl + rl0) + gs0.qrl).last ∨ gs0.qrl ≠ [] ∧ gs0.vtail = ((orl + rl0) + gs0.qrl.butlast).last ∧ gs0.vs[gs0.qrl.last].deqID = None ∧ gs0.vs[gs0.qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = gs0.vhead ∧ (gs0.qrl ≠ [] → unmarkedp(gs0.qrl.tail, gs0.vs)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = gs0.vhead ∧ gs0.phead ≠ (orl + rl0).last ∧ unmarkedp(gs0.qrl, gs0.vs), pretRefs(ls.tid) = gs0.pretRefs(ls.tid) ∨ gs0.vretRefs(ls.tid) = gs0.pretRefs(ls.tid), gs0.phead ∈ orl ∨ gs0.phead ∈ rl0, gs0.phead ∈ orl from phead ∨ gs0.phead ∈ rl0 ∨ gs0.phead ∈ gs0.qrl ⊦ gs0.vs[ls.lst].next = ls.node ∧ gs0.vs[ls.node].val = ls.value ∧ ( ls.lst = gs0.vtail ∧ gs0.ps[ls.lst].next = null ∧ gs0.owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ gs0.qrl) ∧ gs0.ps[ls.lst].next = ls.node) ∧ noid(ls.tid, (orl + rl0) + gs0.qrl, gs0.vhead, gs0.vs) ∧ (gs0.ps[ls.lst].next ≠ gs0.vs[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, gs0.owns, gs0.vs, gs0.ps);noowns(ls.tid, gs0.owns))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0]

Additional information

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, gs0, owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 6 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + rl0 = orl0, vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, gs0 = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], ls.success, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ vs0, phead ∈ ps0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(qrl + rl), ¬ dups(rl0), ¬ dups(orl), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs0[ls.lst].next = ls.node ∧ vs0[ls.node].val = ls.value ∧ ( ls.lst = vtail0 ∧ ps0[ls.lst].next = null ∧ owns0(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ ps0[ls.lst].next = ls.node) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[ls.lst].next ≠ vs0[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, owns0, vs0, ps0);noowns(ls.tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 7 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[ls.lst].next = ls.node, vs[ls.node].val = ls.value, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(ls.tid) = vretRefs0(ls.tid), orl + rl0 ≠ [], ls.node ≠ null, orl ≠ [], ls.success, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, ls.tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(ls.tid, vhead, vs), nextnottidRely(ls.tid, vhead, vs, vhead0, vs0), noid(ls.tid, orl + qrl, vhead, vs), noidRely(ls.tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(ls.tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(ls.tid, rvowns, rvowns0, vrvHp), rvrely(ls.tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[ls.lst].next ≠ ls.node ⊃ oneweakowns(ls.tid, ls.node, owns, vs, ps);noowns(ls.tid, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst = vtail ∧ ps[ls.lst].next = null ∧ owns(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ qrl) ∧ ps[ls.lst].next = ls.node, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(ls.tid) = pretRefs0(ls.tid) ∨ vretRefs0(ls.tid) = pretRefs0(ls.tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ vs0[ls.lst].next = ls.node ∧ vs0[ls.node].val = ls.value ∧ ( ls.lst = vtail0 ∧ ps0[ls.lst].next = null ∧ owns0(ls.node) = Weak(ls.tid) ∨ (ls.lst ∈ orl ∨ ls.lst ∈ rl0 ∨ ls.lst ∈ qrl0) ∧ ps0[ls.lst].next = ls.node) ∧ noid(ls.tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[ls.lst].next ≠ vs0[ls.lst].next ⊃ oneweakowns(ls.tid, ls.node, owns0, vs0, ps0);noowns(ls.tid, owns0))

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkls, seq:⊦ ( ( ( ( ( ( ( ( ( ( (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), subst:[value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval] → [value, nxt, optval0, node, nd, ls, addr, tid, lst, first, rvref, othertid, success, optval]

Additional information

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

Proof step 8 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[lst].next = node, vs[node].val = value, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), success, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], node ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ node ⊃ oneweakowns(tid, node, owns, vs, ps);noowns(tid, owns)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, lst = vtail ∧ ps[lst].next = null ∧ owns(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = node, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs0[lst].next = node ∧ vs0[node].val = value ∧ (lst = vtail0 ∧ ps0[lst].next = null ∧ owns0(node) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = node) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, node, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 9 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix, seq:⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), subst:[ps, rl, owns, r, vs] → [ps, orl + qrl, owns, lst, vs]

Additional information

Used terms: ps, orl + qrl, owns, lst, vs

Proof step 10 from proof stable-E11 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))

A spec-lemma

Proof step 11 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ lst ∈ orl + qrl → (∃ rl1, rl2. orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns)), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 12 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: lst ∈ orl ∨ lst ∈ qrl

Additional information

Used formulas: lst ∈ orl ∨ lst ∈ qrl

Proof step 13 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule case distinction

And obtained the following new goals

Rule argument

fmapos: right 1 splitted: 4

Additional information

Proof step 15 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noidRely-head-1, seq:orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0), subst:[qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs] → [qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: qrl, rl, vhead, vhead0, tid, qrl0, orl, vs0, rl0, vs

Proof step 16 from proof stable-E11 (previous step) (back to tree)

orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead, (orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ⊦ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead → noid(tid, orl + rl0 + qrl0, vhead0, vs0)

A spec-lemma

Proof step 17 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0) ∧ noidRely(tid, orl + qrl, vs, orl + rl0 + qrl0, vs0) ∧ orl ≠ [] ∧ noid(tid, orl + qrl, vhead, vs) ∧ ¬ dups(orl + qrl) ∧ ¬ dups(orl + rl0 + qrl0) ∧ qrl + rl = rl0 + qrl0 ∧ vhead0 ∈ (orl + rl0) + qrl0 from vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 18 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦ (orl.last = vhead ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead) ∧ ((orl + rl0).last = vhead0 ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0)

Heuristic use patterns applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 19 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ vhead, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ orl.butlast ≠ [] ∧ orl.butlast.last = vhead

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 20 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, orl.butlast = [], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], orl.last ≠ [].last, vs[lst].next ≠ null, orl ≠ orl.head ', orl ≠ [], phead ≠ orl.last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, [].last, vs), nextnottidRely(tid, [].last, vs, vhead0, vs0), noid(tid, orl + qrl, [].last, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, vs), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from [].last, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[[].last].next ≠ null ∧ vs[vs[[].last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[[].last].next].deqID.tid)) = Claimed(vs[vs[[].last].next].deqID.tid, vs[vs[[].last].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail1, orl0]

Additional information

Used simplifier rules: ⊦ (a ' + x).butlast = [] ↔ x = []; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail

Proof step 21 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + rl0).last ≠ vhead0, vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noid(tid, (orl + rl0) + qrl0, vhead0, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ x ≠ [] → (x.butlast = [] ↔ x = x.head '); (ss)

Proof step 22 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, (orl + rl0).butlast = [], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ orl.head ', orl + rl0 ≠ [], (orl + rl0).last ≠ [].last, vs[lst].next ≠ null, orl ≠ [], phead0 ≠ (orl + rl0).last, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, [].last, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, vs0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, [].last ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ noid(tid, (orl + rl0) + qrl0, [].last, vs0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs0[[].last].next ≠ null ∧ vs0[vs0[[].last].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[[].last].next].deqID.tid)) = Claimed(vs0[vs0[[].last].next].deqID.tid, vs0[vs0[[].last].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [orl, vtail1, orl0]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' = b ' + x ↔ a = b ∧ x = []; (ws) ⊦ a ' + x ≠ []; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).butlast = [] ↔ x = []; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: orl, head, tail

Proof step 23 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ vs0[lst].next = vs[lst].next

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalrl-def, seq:⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val)), subst:[ps, rl, ps0, vs0, vs] → [ps, orl + qrl, ps0, vs0, vs], <all paths>

Additional information

Used terms: ps, orl + qrl, ps0, vs0, vs

Proof step 24 from proof stable-E11 (previous step) (back to tree)

⊦ equalrl(rl, vs, ps, vs0, ps0) ↔ (∀ r. r ∈ rl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ (vs[rl.last].next ≠ null → vs0[rl.last].next = vs[rl.last].next ∧ vs0[vs0[rl.last].next].val = vs[vs0[rl.last].next].val))

A spec-lemma

Proof step 25 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl + qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ vs0[lst].next = vs[lst].next

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 26 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ vs0[lst].next = vs[lst].next

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 61 terms: lst abort: F discard: F computed: T

Additional information

Used terms: lst

Proof step 27 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 ∈ orl ∨ lst ∈ qrl → vs[lst].val = vs0[lst].val ∧ ps[lst].val = ps0[lst].val ∧ (vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID) ∧ (ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID) ∧ (vs[lst].next ≠ null → vs0[lst].next = vs[lst].next) ∧ (ps[lst].next ≠ null → ps0[lst].next = ps[lst].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next) ∧ ( vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ vs0[lst].next = vs[lst].next

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 28 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, vs0[lst].next = vs[lst].next, vs[lst].val = vs0[lst].val, ps[lst].val = ps0[lst].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, ps[lst].next ≠ null → ps0[lst].next = ps[lst].next, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦ (ps0[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:equalowns-def, seq:⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r)), subst:[ps, ps0, tid, owns, vs0, owns0, vs] → [ps, ps0, tid, owns, vs0, owns0, vs], <all paths>

Additional information

Used terms: ps, ps0, tid, owns, vs0, owns0, vs

Proof step 29 from proof stable-E11 (previous step) (back to tree)

⊦ equalowns(vs, ps, owns, tid, vs0, ps0, owns0) ↔ (∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r))

A spec-lemma

Proof step 30 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, vs0[lst].next = vs[lst].next, ps[lst].val = ps0[lst].val, vs[lst].val = vs0[lst].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[lst].next ≠ null → ps0[lst].next = ps[lst].next, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (ps0[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 68 terms: vs[vtail].next abort: F discard: F computed: T

Additional information

Used terms: vs[vtail].next

Proof step 31 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + rl2, qrl + rl = rl0 + qrl0, vs0[lst].next = vs[lst].next, vs[lst].val = vs0[lst].val, ps[lst].val = ps0[lst].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(lst ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, ps[lst].next ≠ null → ps0[lst].next = ps[lst].next, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].next), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next ⊦ (ps0[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;;

Proof step 32 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, vs0[lst].next = vs[lst].next, ps[lst].val = ps0[lst].val, vs[lst].val = vs0[lst].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl2 = [], vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].next), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[lst].next ≠ null → ps0[lst].next = ps[lst].next, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (ps0[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ weak?(Weak(tid)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ Some(tid) ≠ Weak(tid0); (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)

Proof step 33 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-postfix, seq: ⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ []), subst:[ps, rl, owns, rl0, vs] → [ps0, rl1, owns0, vtail ' + rl, vs0]

Additional information

Used terms: ps0, rl1, owns0, vtail ' + rl, vs0

Proof step 34 from proof stable-E11 (previous step) (back to tree)

⊦ listp(rl + rl0, vs, ps, owns) → (listp(rl0, vs, ps, owns) ↔ rl0 ≠ [])

A spec-lemma

Proof step 35 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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(rl1 + vtail ' + rl, vs0, ps0, owns0) → (listp(vtail ' + rl, vs0, ps0, owns0) ↔ vtail ' + rl ≠ []), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ' + x ≠ []; (s)

Proof step 36 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), listp(rl1 + vtail ' + rl, vs0, ps0, owns0) → listp(vtail ' + rl, vs0, ps0, owns0), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 79

Additional information

Proof step 37 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ listp(rl1 + vtail ' + rl, vs0, ps0, owns0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:a, seq: ⊦ (x + y) + z = x + y + z, subst:[x, y, z] → [rl1, vtail ', rl], <rotated> <all paths>

Additional information

Used terms: rl1, vtail ', rl

Proof step 38 from proof stable-E11 (previous step) (back to tree)

⊦ (x + y) + z = x + y + z

A spec-lemma

Proof step 39 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ listp((rl1 + vtail ') + rl, vs0, ps0, owns0), ¬ weak?(vs[vtail].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 40 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ listp((orl + qrl) + rl, vs0, ps0, owns0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list[reflist], name:a, seq: ⊦ (x + y) + z = x + y + z, subst:[x, y, z] → [orl, qrl, rl], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl, rl

Proof step 41 from proof stable-E11 (previous step) (back to tree)

⊦ (x + y) + z = x + y + z

A spec-lemma

Proof step 42 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(vtail ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val

User applied rule case distinction

And obtained the following new goals

Rule argument

fmapos: right 1 splitted: 1

Additional information

Proof step 43 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 89

Additional information

Proof step 44 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), vtail = (orl + qrl).last, orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(vtail ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ weak?(Weak(tid)); (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist]

Proof step 45 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneweakowns-def, seq:⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps, tid, owns, vs[(orl + qrl).last].next, vs], <all paths>

Additional information

Used terms: ps, tid, owns, vs[(orl + qrl).last].next, vs

Proof step 46 from proof stable-E11 (previous step) (back to tree)

⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 47 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-in-postfix, seq:⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns)), subst:[ps, rl, owns, r, vs] → [ps0, (orl + rl0) + qrl0, owns0, (orl + qrl).last, vs0]

Additional information

Used terms: ps0, (orl + rl0) + qrl0, owns0, (orl + qrl).last, vs0

Proof step 48 from proof stable-E11 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ r ∈ rl → (∃ rl1, rl2. rl = rl1 + r ' + rl2 ∧ listp(r ' + rl2, vs, ps, owns))

A spec-lemma

Proof step 49 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, listp((orl + rl0) + qrl0, vs0, ps0, owns0) ∧ (orl + qrl).last ∈ (orl + rl0) + qrl0 → (∃ rl1, rl2. (orl + rl0) + qrl0 = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs0, ps0, owns0)), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 79

Additional information

Used simplifier rules: ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s)

Proof step 50 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∃ rl1, rl2. (orl + rl0) + qrl0 = rl1 + (orl + qrl).last ' + rl2 ∧ listp((orl + qrl).last ' + rl2, vs0, ps0, owns0), (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 51 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:ownsRely-def, seq:⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid), subst:[tid, owns, owns0] → [tid, owns, owns0], <all paths>

Additional information

Used terms: tid, owns, owns0

Proof step 52 from proof stable-E11 (previous step) (back to tree)

⊦ ownsRely(tid, owns, owns0) ↔ (∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid)

A spec-lemma

Proof step 53 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. (owns(r) ≠ None → owns(r).tid ≠ tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 54 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦ (ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 55 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneweakowns-def, seq:⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps0, tid, owns0, vs[(orl + qrl).last].next, vs0], <all paths>

Additional information

Used terms: ps0, tid, owns0, vs[(orl + qrl).last].next, vs0

Proof step 56 from proof stable-E11 (previous step) (back to tree)

⊦ oneweakowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Weak(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid)

A spec-lemma

Proof step 57 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, ¬ vs[(orl + qrl).last].next ∈ vs0 ∨ ¬ vs[(orl + qrl).last].next ∈ ps0 ∨ owns0(vs[(orl + qrl).last].next) ≠ Weak(tid) ∨ (∃ r0. ¬(r0 ≠ vs[(orl + qrl).last].next ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ tid)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 58 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, ¬ vs[(orl + qrl).last].next ∈ vs0 ∨ ¬ vs[(orl + qrl).last].next ∈ ps0 ∨ owns0(vs[(orl + qrl).last].next) ≠ Weak(tid) ∨ ¬(r0 ≠ vs[(orl + qrl).last].next ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ tid) ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a + x = a ' + x; (s) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 59 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, rl = [], vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, ps0[(orl + qrl).last].next ≠ vs[(orl + qrl).last].next, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ¬ vs[(orl + qrl).last].next ∈ vs0 ∨ ¬ vs[(orl + qrl).last].next ∈ ps0 ∨ owns0(vs[(orl + qrl).last].next) ≠ Weak(tid) ∨ ¬(r0 ≠ vs[(orl + qrl).last].next ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ tid), ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ weak?(Weak(tid)); (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ weak?(opttid) → opttid ≠ None; (as) ⊦ a ∈ b ' ↔ a = b; (s) rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) ⊦ ¬ dups([]); (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)

Proof step 60 from proof stable-E11 (previous step) (back to tree)

orl + rl0 + qrl0 = rl1 + (orl + rl0 + qrl0).last ', (orl + rl0) + qrl0 = rl2 + (orl + rl0 + qrl0).last ' + rl3, vs[vs[(orl + rl0 + qrl0).last].next].deqID = None, vs0[(orl + rl0 + qrl0).last].next = vs[(orl + rl0 + qrl0).last].next, vs[vs[(orl + rl0 + qrl0).last].next].next = null, ps0[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, vs[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, ps[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, ps[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], ps0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], vs0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), owns((orl + rl0 + qrl0).last) = None, owns0((orl + rl0 + qrl0).last) = None, owns0(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), vretRefs(owns0(r0).tid) = vretRefs0(owns0(r0).tid), orl + rl0 ≠ [], orl + rl0 + qrl0 ≠ [], (orl + rl0 + qrl0).last ≠ null, null ≠ vs[(orl + rl0 + qrl0).last].next, orl ≠ [], owns0(r0) ≠ None, r0 ≠ vs[(orl + rl0 + qrl0).last].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0 + qrl0).last ' + rl3, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + rl0 + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(r0).tid, vhead, vs), nextnottidRely(owns0(r0).tid, vhead, vs, vhead0, vs0), noid(owns0(r0).tid, orl + rl0 + qrl0, vhead, vs), noidRely(owns0(r0).tid, orl + rl0 + qrl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + rl0 + qrl0, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(r0).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r0).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(rl0, ps), unmarkedp(qrl0, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + rl0 + qrl0).last ∈ vs, (orl + rl0 + qrl0).last ∈ ps, (orl + rl0 + qrl0).last ∈ ps0, (orl + rl0 + qrl0).last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vs[(orl + rl0 + qrl0).last].next ∈ vs0, vs[(orl + rl0 + qrl0).last].next ∈ ps0, vs[(orl + rl0 + qrl0).last].next ∈ ps, vs[(orl + rl0 + qrl0).last].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + rl0 + qrl0), ¬ weak?(vs0[(orl + rl0 + qrl0).last].deqID), ¬ weak?(vs[(orl + rl0 + qrl0).last].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + rl0 + qrl0).last].deqID ≠ None → vs0[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID, ps[(orl + rl0 + qrl0).last].deqID ≠ None → ps0[(orl + rl0 + qrl0).last].deqID = ps[(orl + rl0 + qrl0).last].deqID, ∀ r. r ∈ orl ∨ r ∈ rl0 ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ≠ vs[(orl + rl0 + qrl0).last].next ∧ owns(r) ≠ None → owns(r).tid ≠ owns0(r0).tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(owns0(r0).tid) ∨ owns(r) = Weak(owns0(r0).tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ owns0(r0).tid, ps[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID ∨ ps[(orl + rl0 + qrl0).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(r0).tid) = pretRefs0(owns0(r0).tid) ∨ vretRefs0(owns0(r0).tid) = pretRefs0(owns0(r0).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), ps0[(orl + rl0 + qrl0).last].deqID = vs0[(orl + rl0 + qrl0).last].deqID ∨ ps0[(orl + rl0 + qrl0).last].deqID = None, orl.last = vhead ∧ (rl0 + qrl0 ≠ [] → unmarkedp((rl0 + qrl0).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(rl0, vs) ∧ unmarkedp(qrl0, vs), (orl + rl0 + qrl0).last ∈ orl ∨ (orl + rl0 + qrl0).last ∈ rl0 ∨ (orl + rl0 + qrl0).last ∈ qrl0 ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 88 terms: r0 abort: F discard: F computed: T

Additional information

Used terms: r0

Proof step 61 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + rl0 + qrl0).last ' + rl3, orl + rl0 + qrl0 = rl1 + (orl + rl0 + qrl0).last ', vs[vs[(orl + rl0 + qrl0).last].next].deqID = None, vs[vs[(orl + rl0 + qrl0).last].next].next = null, vs0[(orl + rl0 + qrl0).last].next = vs[(orl + rl0 + qrl0).last].next, ps[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, vs[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, ps0[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, vs0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], ps0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], ps[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + rl0 + qrl0).last) = None, owns(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), owns0(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), owns0((orl + rl0 + qrl0).last) = None, vretRefs(owns0(r0).tid) = vretRefs0(owns0(r0).tid), orl + rl0 ≠ [], orl + rl0 + qrl0 ≠ [], (orl + rl0 + qrl0).last ≠ null, null ≠ vs[(orl + rl0 + qrl0).last].next, orl ≠ [], owns0(r0) ≠ None, r0 ≠ vs[(orl + rl0 + qrl0).last].next, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + rl0 + qrl0, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + rl0 + qrl0).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(owns0(r0).tid, vhead, vs), nextnottidRely(owns0(r0).tid, vhead, vs, vhead0, vs0), noid(owns0(r0).tid, orl + rl0 + qrl0, vhead, vs), noidRely(owns0(r0).tid, orl + rl0 + qrl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + rl0 + qrl0, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(owns0(r0).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r0).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps), unmarkedp(rl0, ps), unmarkedp(qrl0, ps0), vs[(orl + rl0 + qrl0).last].next ∈ vs, vs[(orl + rl0 + qrl0).last].next ∈ ps, vs[(orl + rl0 + qrl0).last].next ∈ ps0, vs[(orl + rl0 + qrl0).last].next ∈ vs0, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (orl + rl0 + qrl0).last ∈ vs0, (orl + rl0 + qrl0).last ∈ ps0, (orl + rl0 + qrl0).last ∈ ps, (orl + rl0 + qrl0).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + rl0 + qrl0), ¬ weak?(vs0[(orl + rl0 + qrl0).last].deqID), ¬ weak?(vs[(orl + rl0 + qrl0).last].deqID), ps[(orl + rl0 + qrl0).last].deqID ≠ None → ps0[(orl + rl0 + qrl0).last].deqID = ps[(orl + rl0 + qrl0).last].deqID, vs[(orl + rl0 + qrl0).last].deqID ≠ None → vs0[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(r0).tid, ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ owns0(r0).tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(owns0(r0).tid) ∨ owns(r) = Weak(owns0(r0).tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ≠ vs[(orl + rl0 + qrl0).last].next ∧ owns(r) ≠ None → owns(r).tid ≠ owns0(r0).tid, ∀ r. r ∈ orl ∨ r ∈ rl0 ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), (orl + rl0 + qrl0).last ∈ orl ∨ (orl + rl0 + qrl0).last ∈ rl0 ∨ (orl + rl0 + qrl0).last ∈ qrl0, orl.last = vhead ∧ (rl0 + qrl0 ≠ [] → unmarkedp((rl0 + qrl0).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(rl0, vs) ∧ unmarkedp(qrl0, vs), ps0[(orl + rl0 + qrl0).last].deqID = vs0[(orl + rl0 + qrl0).last].deqID ∨ ps0[(orl + rl0 + qrl0).last].deqID = None, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(owns0(r0).tid) = pretRefs0(owns0(r0).tid) ∨ vretRefs0(owns0(r0).tid) = pretRefs0(owns0(r0).tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID ∨ ps[(orl + rl0 + qrl0).last].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 62 from proof stable-E11 (previous step) (back to tree)

orl + rl0 + qrl0 = rl1 + (orl + rl0 + qrl0).last ', (orl + rl0) + qrl0 = rl2 + (orl + rl0 + qrl0).last ' + rl3, vs[vs[(orl + rl0 + qrl0).last].next].deqID = None, vs0[(orl + rl0 + qrl0).last].next = vs[(orl + rl0 + qrl0).last].next, vs[vs[(orl + rl0 + qrl0).last].next].next = null, owns(r0).tid = owns0(r0).tid, ps0[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, vs[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, ps[(orl + rl0 + qrl0).last].val = vs0[(orl + rl0 + qrl0).last].val, ps[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], ps0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], vs0[vs[(orl + rl0 + qrl0).last].next] = vs[vs[(orl + rl0 + qrl0).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), owns((orl + rl0 + qrl0).last) = None, owns0((orl + rl0 + qrl0).last) = None, owns0(vs[(orl + rl0 + qrl0).last].next) = Weak(owns0(r0).tid), vretRefs(owns0(r0).tid) = vretRefs0(owns0(r0).tid), orl + rl0 ≠ [], orl + rl0 + qrl0 ≠ [], (orl + rl0 + qrl0).last ≠ null, null ≠ vs[(orl + rl0 + qrl0).last].next, orl ≠ [], owns(r0) ≠ None, owns0(r0) ≠ None, r0 ≠ vs[(orl + rl0 + qrl0).last].next, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0 + qrl0).last ' + rl3, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + rl0 + qrl0, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(r0).tid, vhead, vs), nextnottidRely(owns0(r0).tid, vhead, vs, vhead0, vs0), noid(owns0(r0).tid, orl + rl0 + qrl0, vhead, vs), noidRely(owns0(r0).tid, orl + rl0 + qrl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + rl0 + qrl0, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(r0).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r0).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(rl0, ps), unmarkedp(qrl0, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + rl0 + qrl0).last ∈ vs, (orl + rl0 + qrl0).last ∈ ps, (orl + rl0 + qrl0).last ∈ ps0, (orl + rl0 + qrl0).last ∈ vs0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vs[(orl + rl0 + qrl0).last].next ∈ vs0, vs[(orl + rl0 + qrl0).last].next ∈ ps0, vs[(orl + rl0 + qrl0).last].next ∈ ps, vs[(orl + rl0 + qrl0).last].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + rl0 + qrl0), ¬ weak?(vs0[(orl + rl0 + qrl0).last].deqID), ¬ weak?(vs[(orl + rl0 + qrl0).last].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + rl0 + qrl0).last].deqID ≠ None → vs0[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID, ps[(orl + rl0 + qrl0).last].deqID ≠ None → ps0[(orl + rl0 + qrl0).last].deqID = ps[(orl + rl0 + qrl0).last].deqID, ∀ r. r ∈ orl ∨ r ∈ rl0 ∨ r ∈ qrl0 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ≠ vs[(orl + rl0 + qrl0).last].next ∧ owns(r) ≠ None → owns(r).tid ≠ owns0(r0).tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(owns0(r0).tid) ∨ owns(r) = Weak(owns0(r0).tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ owns0(r0).tid, ps[(orl + rl0 + qrl0).last].deqID = vs[(orl + rl0 + qrl0).last].deqID ∨ ps[(orl + rl0 + qrl0).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(r0).tid) = pretRefs0(owns0(r0).tid) ∨ vretRefs0(owns0(r0).tid) = pretRefs0(owns0(r0).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), ps0[(orl + rl0 + qrl0).last].deqID = vs0[(orl + rl0 + qrl0).last].deqID ∨ ps0[(orl + rl0 + qrl0).last].deqID = None, orl.last = vhead ∧ (rl0 + qrl0 ≠ [] → unmarkedp((rl0 + qrl0).tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(rl0, vs) ∧ unmarkedp(qrl0, vs), (orl + rl0 + qrl0).last ∈ orl ∨ (orl + rl0 + qrl0).last ∈ rl0 ∨ (orl + rl0 + qrl0).last ∈ qrl0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 88 terms: r0

Additional information

Used terms: r0

Proof step 63 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ noowns(tid, owns0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noowns-def, seq: ⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid), subst:[tid, owns] → [tid, owns0], <all paths>

Additional information

Used terms: tid, owns0

Proof step 64 from proof stable-E11 (previous step) (back to tree)

⊦ noowns(tid, owns) ↔ (∀ r. owns(r) ≠ None → owns(r).tid ≠ tid)

A spec-lemma

Proof step 65 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(tid), owns((orl + qrl).last) = None, vretRefs(tid) = vretRefs0(tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ tid, ∃ r. ¬(owns0(r) ≠ None → owns0(r).tid ≠ tid), ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 66 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), vretRefs(owns0(r).tid) = vretRefs0(owns0(r).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns0(r) ≠ None, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(owns0(r).tid, vhead, vs), nextnottidRely(owns0(r).tid, vhead, vs, vhead0, vs0), noid(owns0(r).tid, orl + qrl, vhead, vs), noidRely(owns0(r).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(owns0(r).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(r).tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(r).tid) ∨ owns(r0) = Weak(owns0(r).tid) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(r).tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(owns0(r).tid) = pretRefs0(owns0(r).tid) ∨ vretRefs0(owns0(r).tid) = pretRefs0(owns0(r).tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 82 terms: r abort: F discard: F computed: T

Additional information

Used terms: r

Proof step 67 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), owns((orl + qrl).last) = None, vretRefs(owns0(r).tid) = vretRefs0(owns0(r).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns0(r) ≠ None, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(r).tid, vhead, vs), nextnottidRely(owns0(r).tid, vhead, vs, vhead0, vs0), noid(owns0(r).tid, orl + qrl, vhead, vs), noidRely(owns0(r).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(r).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, (owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid) ∧ owns0(r) ≠ None → owns0(r).tid ≠ owns0(r).tid, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(r).tid, ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(r).tid) ∨ owns(r0) = Weak(owns0(r).tid) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(r).tid, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(r).tid) = pretRefs0(owns0(r).tid) ∨ vretRefs0(owns0(r).tid) = pretRefs0(owns0(r).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 68 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, owns(r).tid = owns0(r).tid, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), vretRefs(owns0(r).tid) = vretRefs0(owns0(r).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns(r) ≠ None, owns0(r) ≠ None, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(owns0(r).tid, vhead, vs), nextnottidRely(owns0(r).tid, vhead, vs, vhead0, vs0), noid(owns0(r).tid, orl + qrl, vhead, vs), noidRely(owns0(r).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(owns0(r).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(r).tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(r).tid) ∨ owns(r0) = Weak(owns0(r).tid) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(r).tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(owns0(r).tid) = pretRefs0(owns0(r).tid) ∨ vretRefs0(owns0(r).tid) = pretRefs0(owns0(r).tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 87 terms: r abort: F discard: F computed: T

Additional information

Used terms: r

Proof step 69 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, owns(r).tid = owns0(r).tid, vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), owns((orl + qrl).last) = None, vretRefs(owns0(r).tid) = vretRefs0(owns0(r).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns(r) ≠ None, owns0(r) ≠ None, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(r).tid, vhead, vs), nextnottidRely(owns0(r).tid, vhead, vs, vhead0, vs0), noid(owns0(r).tid, orl + qrl, vhead, vs), noidRely(owns0(r).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(r).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(r).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), owns0(vs[(orl + qrl).last].next) ≠ None → vs[(orl + qrl).last].next ∈ vs0 ∧ vs[(orl + qrl).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next] ∧ ps0[vs[(orl + qrl).last].next].next = null ∧ ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ps0[vs[(orl + qrl).last].next].deqID = None ∧ owns0(vs[(orl + qrl).last].next) = Weak(owns0(r).tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, r ≠ vs[(orl + qrl).last].next ∧ owns(r) ≠ None → owns(r).tid ≠ owns0(r).tid, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(r).tid, ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(r).tid) ∨ owns(r0) = Weak(owns0(r).tid) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(r).tid, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(r).tid) = pretRefs0(owns0(r).tid) ∨ vretRefs0(owns0(r).tid) = pretRefs0(owns0(r).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 70 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl).last ', qrl + rl = rl0 + qrl0, (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, ps0[vs[(orl + qrl).last].next].deqID = None, vs[vs[(orl + qrl).last].next].deqID = None, ps0[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl).last) = None, owns(vs[(orl + qrl).last].next) = owns0(vs[(orl + qrl).last].next), owns0(vs[(orl + qrl).last].next) = Weak(owns0(vs[(orl + qrl).last].next).tid), vretRefs(owns0(vs[(orl + qrl).last].next).tid) = vretRefs0(owns0(vs[(orl + qrl).last].next).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns0(vs[(orl + qrl).last].next) ≠ None, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(owns0(vs[(orl + qrl).last].next).tid, vhead, vs), nextnottidRely(owns0(vs[(orl + qrl).last].next).tid, vhead, vs, vhead0, vs0), noid(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vhead, vs), noidRely(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[(orl + qrl).last].next ∈ ps0, vs[(orl + qrl).last].next ∈ vs0, (orl + qrl).last ∈ ps, (orl + qrl).last ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, vs[(orl + qrl).last].next ∈ vs, vs[(orl + qrl).last].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(vs[(orl + qrl).last].next).tid) ∨ owns(r0) = owns0(vs[(orl + qrl).last].next) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid) ∨ vretRefs0(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None ⊦

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

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) ⊦ ¬ dups([]); (s)

Proof step 71 from proof stable-E11 (previous step) (back to tree)

(orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', vs[vs[(orl + qrl).last].next].deqID = None, ps0[vs[(orl + qrl).last].next].deqID = None, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, ps0[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = owns0(vs[(orl + qrl).last].next), owns((orl + qrl).last) = None, owns0(vs[(orl + qrl).last].next) = Weak(owns0(vs[(orl + qrl).last].next).tid), rl = vhead1 + rl4, vretRefs(owns0(vs[(orl + qrl).last].next).tid) = vretRefs0(owns0(vs[(orl + qrl).last].next).tid), orl + qrl ≠ [], orl + rl0 ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns0(vs[(orl + qrl).last].next) ≠ None, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), listp((orl + qrl).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(vs[(orl + qrl).last].next).tid, vhead, vs), nextnottidRely(owns0(vs[(orl + qrl).last].next).tid, vhead, vs, vhead0, vs0), noid(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vhead, vs), noidRely(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, vs[(orl + qrl).last].next ∈ vs0, vs[(orl + qrl).last].next ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + qrl).last].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(vs[(orl + qrl).last].next).tid) ∨ owns(r0) = owns0(vs[(orl + qrl).last].next) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid) ∨ vretRefs0(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ 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)

Proof step 72 from proof stable-E11 (previous step) (back to tree)

qrl + vs[(orl + qrl).last].next ' + rl4 = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl).last ', (orl + rl0) + qrl0 = rl2 + (orl + qrl).last ' + rl3, vs[vs[(orl + qrl).last].next].deqID = None, ps0[vs[(orl + qrl).last].next].deqID = None, ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next, vs[vs[(orl + qrl).last].next].next = null, ps0[vs[(orl + qrl).last].next].next = null, ps0[(orl + qrl).last].val = vs0[(orl + qrl).last].val, vs[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps[(orl + qrl).last].val = vs0[(orl + qrl).last].val, ps0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], vs0[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl).last].next) = owns0(vs[(orl + qrl).last].next), owns((orl + qrl).last) = None, owns0((orl + qrl).last) = None, owns0(vs[(orl + qrl).last].next) = Weak(owns0(vs[(orl + qrl).last].next).tid), vretRefs(owns0(vs[(orl + qrl).last].next).tid) = vretRefs0(owns0(vs[(orl + qrl).last].next).tid), orl + rl0 ≠ [], orl + qrl ≠ [], (orl + qrl).last ≠ null, vs[(orl + qrl).last].next ≠ null, orl ≠ [], owns0(vs[(orl + qrl).last].next) ≠ None, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[(orl + qrl).last].next ' + rl4, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp((orl + qrl).last ' + rl3, vs0, ps0, owns0), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(owns0(vs[(orl + qrl).last].next).tid, vhead, vs), nextnottidRely(owns0(vs[(orl + qrl).last].next).tid, vhead, vs, vhead0, vs0), noid(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vhead, vs), noidRely(owns0(vs[(orl + qrl).last].next).tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, rvowns0, vrvHp), rvrely(owns0(vs[(orl + qrl).last].next).tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (orl + qrl).last ∈ ps0, (orl + qrl).last ∈ vs0, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, (orl + qrl).last ∈ vs, (orl + qrl).last ∈ ps, vs[(orl + qrl).last].next ∈ vs0, vs[(orl + qrl).last].next ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl4), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ weak?(vs0[(orl + qrl).last].deqID), ¬ weak?(vs[(orl + qrl).last].deqID), ¬ vs[(orl + qrl).last].next ∈ rl4, 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl).last].deqID ≠ None → vs0[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID, ps[(orl + qrl).last].deqID ≠ None → ps0[(orl + qrl).last].deqID = ps[(orl + qrl).last].deqID, ∀ r0. r0 ≠ vs[(orl + qrl).last].next ∧ owns(r0) ≠ None → owns(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, ∀ r0. r0 ∈ vs ∧ r0 ∈ ps ∧ (owns(r0) = Some(owns0(vs[(orl + qrl).last].next).tid) ∨ owns(r0) = owns0(vs[(orl + qrl).last].next) ∧ owns0(r0) ≠ None) → r0 ∈ vs0 ∧ r0 ∈ ps0 ∧ vs0[r0] = vs[r0] ∧ (ps0[r0].next = ps[r0].next ∨ ps0[r0].next = vs[r0].next) ∧ (ps0[r0].val = ps[r0].val ∨ ps0[r0].val = vs[r0].val) ∧ (ps0[r0].deqID = ps[r0].deqID ∨ ps0[r0].deqID = vs[r0].deqID) ∧ owns0(r0) = owns(r0), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r0. (owns(r0) ≠ None → owns(r0).tid ≠ owns0(r0).tid) ∧ owns0(r0) ≠ None → owns0(r0).tid ≠ owns0(vs[(orl + qrl).last].next).tid, ps0[(orl + qrl).last].deqID = vs0[(orl + qrl).last].deqID ∨ ps0[(orl + qrl).last].deqID = None, ps[(orl + qrl).last].deqID = vs[(orl + qrl).last].deqID ∨ ps[(orl + qrl).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid) ∨ vretRefs0(owns0(vs[(orl + qrl).last].next).tid) = pretRefs0(owns0(vs[(orl + qrl).last].next).tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + qrl).last ∈ orl ∨ (orl + qrl).last ∈ qrl ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl4

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a + x = a ' + x; (s) ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (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)

Proof step 73 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[qrl.last].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, vs[qrl.last].next = null, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), vtail = (orl + qrl.butlast).last, orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], qrl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(vtail ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ (ps0[vtail].next ≠ vs[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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 ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist] ⊦ y ≠ [] → (x + y).last = y.last; (s)

Proof step 74 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + (orl + qrl.butlast).last ', qrl + rl = rl0 + qrl0, vs[vs[(orl + qrl.butlast).last].next].deqID = None, vs[qrl.last].deqID = None, vs[vs[(orl + qrl.butlast).last].next].next = null, ps[(orl + qrl.butlast).last].next = null, vs0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, vs[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, ps0[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, ps[vs[(orl + qrl.butlast).last].next] = vs[vs[(orl + qrl.butlast).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + qrl.butlast).last) = None, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + qrl.butlast).last ≠ null, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + qrl.butlast).last ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead ∈ rl1, vs[(orl + qrl.butlast).last].next ∈ ps, vs[(orl + qrl.butlast).last].next ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl.butlast).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (orl + qrl.butlast).last ∈ qrl, (orl + qrl.butlast).last ∈ vs, (orl + qrl.butlast).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[(orl + qrl.butlast).last].deqID), owns0(vs[(orl + qrl.butlast).last].next) ≠ None → vs[(orl + qrl.butlast).last].next ∈ vs0 ∧ vs[(orl + qrl.butlast).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl.butlast).last].next] = vs[vs[(orl + qrl.butlast).last].next] ∧ ps0[vs[(orl + qrl.butlast).last].next].next = null ∧ ps0[vs[(orl + qrl.butlast).last].next].val = vs[vs[(orl + qrl.butlast).last].next].val ∧ ps0[vs[(orl + qrl.butlast).last].next].deqID = None ∧ owns0(vs[(orl + qrl.butlast).last].next) = Weak(tid), ps[(orl + qrl.butlast).last].deqID ≠ None → ps0[(orl + qrl.butlast).last].deqID = ps[(orl + qrl.butlast).last].deqID, vs[(orl + qrl.butlast).last].deqID ≠ None → vs0[(orl + qrl.butlast).last].deqID = vs[(orl + qrl.butlast).last].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[(orl + qrl.butlast).last].deqID = vs[(orl + qrl.butlast).last].deqID ∨ ps[(orl + qrl.butlast).last].deqID = None, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ (ps0[(orl + qrl.butlast).last].next ≠ vs[(orl + qrl.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, vtail, rl2]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 75 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + (orl + qrl.butlast).last ', vs[qrl.last].deqID = None, vs[vs[(orl + qrl.butlast).last].next].deqID = None, vs[qrl.last].next = null, vs0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next, ps[(orl + qrl.butlast).last].next = null, vs[vs[(orl + qrl.butlast).last].next].next = null, ps0[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, vs[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, ps[(orl + qrl.butlast).last].val = vs0[(orl + qrl.butlast).last].val, ps[vs[(orl + qrl.butlast).last].next] = vs[vs[(orl + qrl.butlast).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), owns((orl + qrl.butlast).last) = None, qrl = vtail + rl2, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + qrl.butlast).last ≠ null, vs[(orl + qrl.butlast).last].next ≠ null, orl ≠ [], qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + qrl.butlast).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), (orl + qrl.butlast).last ∈ ps, (orl + qrl.butlast).last ∈ vs, (orl + qrl.butlast).last ∈ qrl, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + qrl.butlast).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vs[(orl + qrl.butlast).last].next ∈ vs, vs[(orl + qrl.butlast).last].next ∈ ps, phead ∈ rl1, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[(orl + qrl.butlast).last].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[(orl + qrl.butlast).last].deqID ≠ None → vs0[(orl + qrl.butlast).last].deqID = vs[(orl + qrl.butlast).last].deqID, ps[(orl + qrl.butlast).last].deqID ≠ None → ps0[(orl + qrl.butlast).last].deqID = ps[(orl + qrl.butlast).last].deqID, owns0(vs[(orl + qrl.butlast).last].next) ≠ None → vs[(orl + qrl.butlast).last].next ∈ vs0 ∧ vs[(orl + qrl.butlast).last].next ∈ ps0 ∧ vs0[vs[(orl + qrl.butlast).last].next] = vs[vs[(orl + qrl.butlast).last].next] ∧ ps0[vs[(orl + qrl.butlast).last].next].next = null ∧ ps0[vs[(orl + qrl.butlast).last].next].val = vs[vs[(orl + qrl.butlast).last].next].val ∧ ps0[vs[(orl + qrl.butlast).last].next].deqID = None ∧ owns0(vs[(orl + qrl.butlast).last].next) = Weak(tid), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), orl.last = vhead ∧ unmarkedp(rl2, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ps[(orl + qrl.butlast).last].deqID = vs[(orl + qrl.butlast).last].deqID ∨ ps[(orl + qrl.butlast).last].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ (ps0[(orl + qrl.butlast).last].next ≠ vs[(orl + qrl.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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] in-14: ⊦ a ' + x = 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) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ' + x ≠ []; (s)

Proof step 76 from proof stable-E11 (previous step) (back to tree)

(vtail ' + rl2) + rl = rl0 + qrl0, orl + vtail ' + rl2 = rl1 + (orl + (vtail ' + rl2).butlast).last ', ps[vtail].deqID = None, vs[(vtail ' + rl2).last].deqID = None, vs[vs[(orl + (vtail ' + rl2).butlast).last].next].deqID = None, vs[(vtail ' + rl2).last].next = null, vs0[(orl + (vtail ' + rl2).butlast).last].next = vs[(orl + (vtail ' + rl2).butlast).last].next, ps[(orl + (vtail ' + rl2).butlast).last].next = null, vs[vs[(orl + (vtail ' + rl2).butlast).last].next].next = null, ps0[(orl + (vtail ' + rl2).butlast).last].val = vs0[(orl + (vtail ' + rl2).butlast).last].val, vs[(orl + (vtail ' + rl2).butlast).last].val = vs0[(orl + (vtail ' + rl2).butlast).last].val, ps[(orl + (vtail ' + rl2).butlast).last].val = vs0[(orl + (vtail ' + rl2).butlast).last].val, ps[vs[(orl + (vtail ' + rl2).butlast).last].next] = vs[vs[(orl + (vtail ' + rl2).butlast).last].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + (vtail ' + rl2).butlast).last].next) = Weak(tid), owns((orl + (vtail ' + rl2).butlast).last) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + (vtail ' + rl2).butlast).last ≠ null, vs[(orl + (vtail ' + rl2).butlast).last].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + (vtail ' + rl2).butlast).last ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + vtail ' + rl2, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vtail ' + rl2, vhead, vs), noidRely(tid, orl + vtail ' + rl2, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + vtail ' + rl2, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (vtail ' + rl2).butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(rl2, ps), (orl + (vtail ' + rl2).butlast).last ∈ ps, (orl + (vtail ' + rl2).butlast).last ∈ vs, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from (orl + (vtail ' + rl2).butlast).last, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vs[(orl + (vtail ' + rl2).butlast).last].next ∈ vs, vs[(orl + (vtail ' + rl2).butlast).last].next ∈ ps, phead ∈ rl1, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(orl), ¬ dups(orl + rl2), ¬ dups((orl + rl0) + qrl0), ¬ dups(rl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + (vtail ' + rl2).butlast).last].deqID), ¬ vtail ∈ orl, ¬ vtail ∈ rl2, vs[(orl + (vtail ' + rl2).butlast).last].deqID ≠ None → vs0[(orl + (vtail ' + rl2).butlast).last].deqID = vs[(orl + (vtail ' + rl2).butlast).last].deqID, ps[(orl + (vtail ' + rl2).butlast).last].deqID ≠ None → ps0[(orl + (vtail ' + rl2).butlast).last].deqID = ps[(orl + (vtail ' + rl2).butlast).last].deqID, owns0(vs[(orl + (vtail ' + rl2).butlast).last].next) ≠ None → vs[(orl + (vtail ' + rl2).butlast).last].next ∈ vs0 ∧ vs[(orl + (vtail ' + rl2).butlast).last].next ∈ ps0 ∧ vs0[vs[(orl + (vtail ' + rl2).butlast).last].next] = vs[vs[(orl + (vtail ' + rl2).butlast).last].next] ∧ ps0[vs[(orl + (vtail ' + rl2).butlast).last].next].next = null ∧ ps0[vs[(orl + (vtail ' + rl2).butlast).last].next].val = vs[vs[(orl + (vtail ' + rl2).butlast).last].next].val ∧ ps0[vs[(orl + (vtail ' + rl2).butlast).last].next].deqID = None ∧ owns0(vs[(orl + (vtail ' + rl2).butlast).last].next) = Weak(tid), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r. r ∈ orl ∨ r = vtail ∨ r ∈ rl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), orl.last = vhead ∧ unmarkedp(rl2, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail].deqID = None ∧ unmarkedp(rl2, vs), ps[(orl + (vtail ' + rl2).butlast).last].deqID = vs[(orl + (vtail ' + rl2).butlast).last].deqID ∨ ps[(orl + (vtail ' + rl2).butlast).last].deqID = None, (orl + (vtail ' + rl2).butlast).last = vtail ∨ (orl + (vtail ' + rl2).butlast).last ∈ rl2, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail ∈ rl0 ∨ vtail ∈ qrl0 ⊦ (ps0[(orl + (vtail ' + rl2).butlast).last].next ≠ vs[(orl + (vtail ' + rl2).butlast).last].next ⊃ oneweakowns(tid, vs[(orl + (vtail ' + rl2).butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [vtail ', rl2], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ ¬ dups([]); (s) ⊦ unmarkedp([], vs); (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) Used terms: vtail ', rl2

Proof step 77 from proof stable-E11 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 78 from proof stable-E11 (previous step) (back to tree)

orl + vtail ' + rl2 = rl1 + (orl + vtail ' + rl2.butlast).last ', (vtail ' + rl2) + rl = rl0 + qrl0, vs[vs[(orl + vtail ' + rl2.butlast).last].next].deqID = None, vs[(vtail ' + rl2).last].deqID = None, ps[vtail].deqID = None, vs[vs[(orl + vtail ' + rl2.butlast).last].next].next = null, ps[(orl + vtail ' + rl2.butlast).last].next = null, vs0[(orl + vtail ' + rl2.butlast).last].next = vs[(orl + vtail ' + rl2.butlast).last].next, vs[(vtail ' + rl2).last].next = null, ps[(orl + vtail ' + rl2.butlast).last].val = vs0[(orl + vtail ' + rl2.butlast).last].val, vs[(orl + vtail ' + rl2.butlast).last].val = vs0[(orl + vtail ' + rl2.butlast).last].val, ps0[(orl + vtail ' + rl2.butlast).last].val = vs0[(orl + vtail ' + rl2.butlast).last].val, ps[vs[(orl + vtail ' + rl2.butlast).last].next] = vs[vs[(orl + vtail ' + rl2.butlast).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((orl + vtail ' + rl2.butlast).last) = None, owns(vs[(orl + vtail ' + rl2.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + vtail ' + rl2.butlast).last ≠ null, vs[(orl + vtail ' + rl2.butlast).last].next ≠ null, orl ≠ [], rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + vtail ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp((orl + vtail ' + rl2.butlast).last ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vtail ' + rl2, vhead, vs), noidRely(tid, orl + vtail ' + rl2, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + vtail ' + rl2, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(orl + vtail ' + rl2.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(rl2, ps), unmarkedp(qrl0, ps0), phead ∈ rl1, vs[(orl + vtail ' + rl2.butlast).last].next ∈ ps, vs[(orl + vtail ' + rl2.butlast).last].next ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (orl + vtail ' + rl2.butlast).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (orl + vtail ' + rl2.butlast).last ∈ vs, (orl + vtail ' + rl2.butlast).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(orl), ¬ dups(orl + rl2), ¬ dups((orl + rl0) + qrl0), ¬ dups(rl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[(orl + vtail ' + rl2.butlast).last].deqID), ¬ vtail ∈ orl, ¬ vtail ∈ rl2, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(orl + vtail ' + rl2.butlast).last].next) ≠ None → vs[(orl + vtail ' + rl2.butlast).last].next ∈ vs0 ∧ vs[(orl + vtail ' + rl2.butlast).last].next ∈ ps0 ∧ vs0[vs[(orl + vtail ' + rl2.butlast).last].next] = vs[vs[(orl + vtail ' + rl2.butlast).last].next] ∧ ps0[vs[(orl + vtail ' + rl2.butlast).last].next].next = null ∧ ps0[vs[(orl + vtail ' + rl2.butlast).last].next].val = vs[vs[(orl + vtail ' + rl2.butlast).last].next].val ∧ ps0[vs[(orl + vtail ' + rl2.butlast).last].next].deqID = None ∧ owns0(vs[(orl + vtail ' + rl2.butlast).last].next) = Weak(tid), ps[(orl + vtail ' + rl2.butlast).last].deqID ≠ None → ps0[(orl + vtail ' + rl2.butlast).last].deqID = ps[(orl + vtail ' + rl2.butlast).last].deqID, vs[(orl + vtail ' + rl2.butlast).last].deqID ≠ None → vs0[(orl + vtail ' + rl2.butlast).last].deqID = vs[(orl + vtail ' + rl2.butlast).last].deqID, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r = vtail ∨ r ∈ rl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), vtail ∈ rl0 ∨ vtail ∈ qrl0, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, (orl + vtail ' + rl2.butlast).last = vtail ∨ (orl + vtail ' + rl2.butlast).last ∈ rl2, ps[(orl + vtail ' + rl2.butlast).last].deqID = vs[(orl + vtail ' + rl2.butlast).last].deqID ∨ ps[(orl + vtail ' + rl2.butlast).last].deqID = None, orl.last = vhead ∧ unmarkedp(rl2, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail].deqID = None ∧ unmarkedp(rl2, vs) ⊦ (ps0[(orl + vtail ' + rl2.butlast).last].next ≠ vs[(orl + vtail ' + rl2.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + vtail ' + rl2.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 79 from proof stable-E11 (previous step) (back to tree)

orl + vtail ' + rl2 = rl1 + (vtail ' + rl2.butlast).last ', (vtail ' + rl2) + rl = rl0 + qrl0, vs[vs[(vtail ' + rl2.butlast).last].next].deqID = None, vs[rl2.last].deqID = None, ps[vtail].deqID = None, vs[vs[(vtail ' + rl2.butlast).last].next].next = null, ps[(vtail ' + rl2.butlast).last].next = null, vs0[(vtail ' + rl2.butlast).last].next = vs[(vtail ' + rl2.butlast).last].next, vs[rl2.last].next = null, ps[(vtail ' + rl2.butlast).last].val = vs0[(vtail ' + rl2.butlast).last].val, vs[(vtail ' + rl2.butlast).last].val = vs0[(vtail ' + rl2.butlast).last].val, ps0[(vtail ' + rl2.butlast).last].val = vs0[(vtail ' + rl2.butlast).last].val, ps[vs[(vtail ' + rl2.butlast).last].next] = vs[vs[(vtail ' + rl2.butlast).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns((vtail ' + rl2.butlast).last) = None, owns(vs[(vtail ' + rl2.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (vtail ' + rl2.butlast).last ≠ null, vs[(vtail ' + rl2.butlast).last].next ≠ null, orl ≠ [], rl2 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((vtail ' + rl2.butlast).last ' + rl, vs0, ps0, owns0), listp(orl + vtail ' + rl2, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + vtail ' + rl2, vhead, vs), noidRely(tid, orl + vtail ' + rl2, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + vtail ' + rl2, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(vtail ' + rl2.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(rl2, ps), unmarkedp(qrl0, ps0), phead ∈ rl1, vs[(vtail ' + rl2.butlast).last].next ∈ ps, vs[(vtail ' + rl2.butlast).last].next ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from (vtail ' + rl2.butlast).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, (vtail ' + rl2.butlast).last ∈ rl2, (vtail ' + rl2.butlast).last ∈ vs, (vtail ' + rl2.butlast).last ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + rl2), ¬ dups(orl), ¬ dups(rl2), ¬ weak?(vs[(vtail ' + rl2.butlast).last].deqID), ¬ vtail ∈ rl2, ¬ vtail ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), owns0(vs[(vtail ' + rl2.butlast).last].next) ≠ None → vs[(vtail ' + rl2.butlast).last].next ∈ vs0 ∧ vs[(vtail ' + rl2.butlast).last].next ∈ ps0 ∧ vs0[vs[(vtail ' + rl2.butlast).last].next] = vs[vs[(vtail ' + rl2.butlast).last].next] ∧ ps0[vs[(vtail ' + rl2.butlast).last].next].next = null ∧ ps0[vs[(vtail ' + rl2.butlast).last].next].val = vs[vs[(vtail ' + rl2.butlast).last].next].val ∧ ps0[vs[(vtail ' + rl2.butlast).last].next].deqID = None ∧ owns0(vs[(vtail ' + rl2.butlast).last].next) = Weak(tid), ps[(vtail ' + rl2.butlast).last].deqID ≠ None → ps0[(vtail ' + rl2.butlast).last].deqID = ps[(vtail ' + rl2.butlast).last].deqID, vs[(vtail ' + rl2.butlast).last].deqID ≠ None → vs0[(vtail ' + rl2.butlast).last].deqID = vs[(vtail ' + rl2.butlast).last].deqID, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r = vtail ∨ r ∈ rl2 → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[(vtail ' + rl2.butlast).last].deqID = vs[(vtail ' + rl2.butlast).last].deqID ∨ ps[(vtail ' + rl2.butlast).last].deqID = None, vtail ∈ rl0 ∨ vtail ∈ qrl0, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(rl2, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[vtail].deqID = None ∧ unmarkedp(rl2, vs) ⊦ (ps0[(vtail ' + rl2.butlast).last].next ≠ vs[(vtail ' + rl2.butlast).last].next ⊃ oneweakowns(tid, vs[(vtail ' + rl2.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

User applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [rl2, phead1, qrl]

Additional information

Used simplifier rules: ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: rl2, phead1, y

Proof step 80 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vtail ' + rl, vs0, ps0, owns0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl ⊦ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ x + [] = x; (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) ⊦ ¬ dups([]); (s) ⊦ weak?(opttid) → opttid ≠ None; (as) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) 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 ↔ a ∈ x ∨ a ∈ y; (s) ⊦ weak?(Weak(tid)); (s) ⊦ ¬ dups(a '); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 81 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + rl = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), rl = vtail1 + rl2, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(vtail ' + rl, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ weak?(vs[vtail].deqID), owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ( vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ 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)

Proof step 82 from proof stable-E11 (previous step) (back to tree)

qrl + vs[vtail].next ' + rl2 = rl0 + qrl0, orl + qrl = rl1 + vtail ', vs[vs[vtail].next].deqID = None, ps0[vtail].next = vs[vtail].next, vs[vs[vtail].next].next = null, ps[vtail].next = null, vs0[vtail].next = vs[vtail].next, ps[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps0[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vtail) = None, owns(vs[vtail].next) = Weak(tid), owns0(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[vtail].next ' + rl2, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail ∈ ps0, vtail ∈ vs0, vs[vtail].next ∈ ps, vs[vtail].next ∈ vs, vtail ∈ ps, vtail ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ weak?(vs0[vtail].deqID), ¬ weak?(vs[vtail].deqID), ¬ vs[vtail].next ∈ rl2, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ps0[vtail].deqID = vs0[vtail].deqID ∨ ps0[vtail].deqID = None, vtail ∈ orl ∨ vtail ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None ⊦ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0)

User applied rule all left

And obtained the following new goals

Rule argument

pos: left 86 terms: vs[vtail].next abort: F discard: F computed: T

Additional information

Used terms: vs[vtail].next

Proof step 83 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + vs[vtail].next ' + rl2 = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].next = vs[vtail].next, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, owns0(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp(vs[vtail].next ' + rl2, vs0, ps0, owns0), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, vtail ∈ vs0, vtail ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl2), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ weak?(vs0[vtail].deqID), ¬ weak?(vs[vtail].deqID), ¬ vs[vtail].next ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[vtail].next ∈ orl ∨ vs[vtail].next ∈ qrl → vs[vs[vtail].next].val = vs0[vs[vtail].next].val ∧ ps[vs[vtail].next].val = ps0[vs[vtail].next].val ∧ (vs[vs[vtail].next].deqID ≠ None → vs0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ (ps[vs[vtail].next].deqID ≠ None → ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID) ∧ (vs[vs[vtail].next].next ≠ null → vs0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps[vs[vtail].next].next ≠ null → ps0[vs[vtail].next].next = ps[vs[vtail].next].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl, ps0[vtail].deqID = vs0[vtail].deqID ∨ ps0[vtail].deqID = None ⊦ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 84 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + vtail ', qrl + vs[vtail].next ' + rl2 = rl0 + qrl0, vs[vs[vtail].next].deqID = None, vs0[vtail].next = vs[vtail].next, ps[vtail].next = null, vs[vs[vtail].next].next = null, ps0[vtail].next = vs[vtail].next, ps0[vtail].val = vs0[vtail].val, vs[vtail].val = vs0[vtail].val, ps[vtail].val = vs0[vtail].val, ps[vs[vtail].next] = vs[vs[vtail].next], dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), owns(vtail) = None, owns0(vtail) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[vtail].next ≠ null, orl ≠ [], vtail ≠ null, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp(vs[vtail].next ' + rl2, vs0, ps0, owns0), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, vtail ∈ vs, vtail ∈ ps, vs[vtail].next ∈ vs, vs[vtail].next ∈ ps, vtail ∈ vs0, vtail ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl2), ¬ weak?(vs[vtail].deqID), ¬ weak?(vs0[vtail].deqID), ¬ vs[vtail].next ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[vtail].deqID ≠ None → vs0[vtail].deqID = vs[vtail].deqID, ps[vtail].deqID ≠ None → ps0[vtail].deqID = ps[vtail].deqID, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, owns0(vs[vtail].next) ≠ None → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ ps0[vs[vtail].next].next = null ∧ ps0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ ps0[vs[vtail].next].deqID = None ∧ owns0(vs[vtail].next) = Weak(tid), vs[vtail].next ∈ orl ∨ vs[vtail].next ∈ qrl → vs[vs[vtail].next].val = vs0[vs[vtail].next].val ∧ vs[vs[vtail].next].val = ps0[vs[vtail].next].val, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[vtail].deqID = vs[vtail].deqID ∨ ps[vtail].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail ∈ orl ∨ vtail ∈ qrl, ps0[vtail].deqID = vs0[vtail].deqID ∨ ps0[vtail].deqID = None ⊦ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ vtail ∈ orl ∨ vtail ∈ rl0 ∨ vtail ∈ qrl0)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:splitlasteq, seq:y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last, subst:[y, x, a] → [orl + qrl, rl1, vtail], <all paths>

Additional information

Used simplifier rules: ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ r ∈ rl → rl from r = []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) Used terms: orl + qrl, rl1, vtail

Proof step 85 from proof stable-E11 (previous step) (back to tree)

y ≠ [] ⊦ x + a ' = y ↔ x = y.butlast ∧ a = y.last

A spec-lemma

Proof step 86 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + rl2, vs0[lst].next = vs[lst].next, ps[lst].val = ps0[lst].val, vs[lst].val = vs0[lst].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, rl2 = lst0 + rl3, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(lst ' + rl2, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].next), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ps[lst].next ≠ null → ps0[lst].next = ps[lst].next, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ ps[lst].next = vs[lst].next, lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ (ps0[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0)) ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ noowns(tid, owns) ∧ ownsRely(tid, owns, owns0) → noowns(tid, owns0); (ss) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a + x = a ' + x; (s)

Proof step 87 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + vs[lst].next ' + rl3, qrl + rl = rl0 + qrl0, ps[lst].next = vs[lst].next, vs0[lst].next = vs[lst].next, ps0[lst].next = vs[lst].next, ps[lst].val = vs0[lst].val, vs[lst].val = vs0[lst].val, ps0[lst].val = vs0[lst].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(lst) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[lst].next ' + rl3, vs, ps, owns), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), lst ∈ ps, lst ∈ vs, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[lst].deqID), ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].next), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None ⊦ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 88 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + vs[lst].next ' + rl3, ps0[lst].next = vs[lst].next, vs0[lst].next = vs[lst].next, ps[lst].next = vs[lst].next, ps0[lst].val = vs0[lst].val, vs[lst].val = vs0[lst].val, ps[lst].val = vs0[lst].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(lst) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp(vs[lst].next ' + rl3, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[lst].deqID), ¬ lst ∈ orl, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦ lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 89 from proof stable-E11 (previous step) (back to tree)

orl + qrl = rl1 + lst ' + vs[lst].next ' + rl3, qrl + rl = rl0 + qrl0, ps[lst].next = vs[lst].next, vs0[lst].next = vs[lst].next, ps0[lst].next = vs[lst].next, ps[lst].val = vs0[lst].val, vs[lst].val = vs0[lst].val, ps0[lst].val = vs0[lst].val, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(lst) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, lst ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(vs[lst].next ' + rl3, vs, ps, owns), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vtail0 ∈ (orl + rl0) + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, lst ∈ qrl, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[lst].deqID), ¬ lst ∈ orl, ¬ lst ∈ rl0, ¬ lst ∈ qrl0, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].next), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None ⊦ lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid)

Heuristic elimination applied rule apply elim lemma

And closed the goal!

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [qrl, vtail1, rl2]

Additional information

Used simplifier rules: ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ' + x ≠ []; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ in-14: ⊦ a ' + x = 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 ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ 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 + [] = x; (s) ⊦ ¬ a ∈ x → x ≠ y + a ' + z; (s) x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: qrl, vtail1, y

Proof step 90 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, orl + qrl = rl1 + lst ' + vs[lst].next ' + rl3, ps0[lst].next = vs[lst].next, vs0[lst].next = vs[lst].next, ps[lst].next = vs[lst].next, ps0[lst].val = vs0[lst].val, vs[lst].val = vs0[lst].val, ps[lst].val = vs0[lst].val, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(lst) = None, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, vs0[vs[lst].next].val ≠ vs[vs[lst].next].val, lst ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), listp(vs[lst].next ' + rl3, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, lst ∈ vs, lst ∈ ps, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(orl), ¬ dups(rl), ¬ dups(qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ weak?(vs[lst].deqID), vs[(orl + qrl).last].next ≠ null → vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs0[(orl + qrl).last].next].val = vs[vs0[(orl + qrl).last].next].val, vs[vtail].next ∈ vs ∧ vs[vtail].next ∈ ps ∧ (owns(vs[vtail].next) = Some(tid) ∨ owns(vs[vtail].next) = Weak(tid) ∧ owns0(vs[vtail].next) ≠ None) → vs[vtail].next ∈ vs0 ∧ vs[vtail].next ∈ ps0 ∧ vs0[vs[vtail].next] = vs[vs[vtail].next] ∧ (ps0[vs[vtail].next].next = ps[vs[vtail].next].next ∨ ps0[vs[vtail].next].next = vs[vs[vtail].next].next) ∧ (ps0[vs[vtail].next].val = ps[vs[vtail].next].val ∨ ps0[vs[vtail].next].val = vs[vs[vtail].next].val) ∧ (ps0[vs[vtail].next].deqID = ps[vs[vtail].next].deqID ∨ ps0[vs[vtail].next].deqID = vs[vs[vtail].next].deqID) ∧ owns0(vs[vtail].next) = owns(vs[vtail].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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].deqID ≠ None → vs0[lst].deqID = vs[lst].deqID, ps[lst].deqID ≠ None → ps0[lst].deqID = ps[lst].deqID, ∀ r. r ∈ vs ∧ r ∈ ps ∧ (owns(r) = Some(tid) ∨ owns(r) = Weak(tid) ∧ owns0(r) ≠ None) → r ∈ vs0 ∧ r ∈ ps0 ∧ vs0[r] = vs[r] ∧ (ps0[r].next = ps[r].next ∨ ps0[r].next = vs[r].next) ∧ (ps0[r].val = ps[r].val ∨ ps0[r].val = vs[r].val) ∧ (ps0[r].deqID = ps[r].deqID ∨ ps0[r].deqID = vs[r].deqID) ∧ owns0(r) = owns(r), ∀ r. r ∈ orl ∨ r ∈ qrl → vs[r].val = vs0[r].val ∧ ps[r].val = ps0[r].val ∧ (vs[r].deqID ≠ None → vs0[r].deqID = vs[r].deqID) ∧ (ps[r].deqID ≠ None → ps0[r].deqID = ps[r].deqID) ∧ (vs[r].next ≠ null → vs0[r].next = vs[r].next) ∧ (ps[r].next ≠ null → ps0[r].next = ps[r].next), ps[lst].deqID = vs[lst].deqID ∨ ps[lst].deqID = None, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl ⊦

User applied rule all left

And closed the goal!

Rule argument

pos: left 77 terms: vs[lst].next abort: F discard: F computed: T

Additional information

Used simplifier rules: notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) Used terms: vs[lst].next

Proof step 91 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], vs[lst].next ≠ null, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ (orl + rl0) + qrl0 from vtail, phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ lst ∈ orl, ¬ lst ∈ qrl, lst ∈ orl ∨ lst ∈ qrl → orl + qrl = rl1 + lst ' + rl2 ∧ listp(lst ' + rl2, vs, ps, owns), 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), (ps[lst].next ≠ vs[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns, vs, ps);noowns(tid, owns)), lst = vtail ∧ ps[vtail].next = null ∧ owns(vs[vtail].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ qrl) ∧ ps[lst].next = vs[lst].next, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ vs0[lst].next = vs[lst].next ∧ vs0[vs[lst].next].val = vs[vs[lst].next].val ∧ (lst = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (lst ∈ orl ∨ lst ∈ rl0 ∨ lst ∈ qrl0) ∧ ps0[lst].next = vs[lst].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[lst].next ≠ vs0[lst].next ⊃ oneweakowns(tid, vs[lst].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ owns(r) = Weak(tid) → ¬ noowns(tid, owns); (s)

Proof step 92 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vtail].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], null ≠ vs[vtail].next, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail0 ∈ rl0 + qrl0 from vtail, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vtail ∈ orl, ¬ vtail ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ vs0[vtail].next = vs[vtail].next ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[vtail].next ≠ vs0[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 64

Additional information

Proof step 93 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, ps[vtail].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), vtail = (orl + qrl).last, orl + rl0 ≠ [], null ≠ vs[vtail].next, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vtail ∈ orl, ¬ vtail ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[vtail].next = vs[vtail].next ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[vtail].next ≠ vs0[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ weak?(Weak(tid)); (s) fw-weak-oneweakowns: ⊦ oneweakowns(tid, r0, owns, vs, ps) ∧ owns(r) = Weak(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ listp-nextoflast: ⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next ≠ null → vs[rl.last].next ∈ vs ∧ vs[rl.last].next ∈ ps ∧ ps[vs[rl.last].next] = vs[vs[rl.last].next] ∧ ps[vs[rl.last].next].deqID = None ∧ ps[vs[rl.last].next].next = null ∧ weak?(owns(vs[rl.last].next)); (forward) from specification DMSQ

Proof step 94 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[vs[(orl + qrl).last].next].deqID = None, ps[(orl + qrl).last].next = null, vs[vs[(orl + qrl).last].next].next = null, ps[vs[(orl + qrl).last].next] = vs[vs[(orl + qrl).last].next], dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[(orl + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], null ≠ vs[(orl + qrl).last].next, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(orl + qrl).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail0 ∈ rl0 + qrl0 from (orl + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, vs[(orl + qrl).last].next ∈ ps, vs[(orl + qrl).last].next ∈ vs, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + qrl).last ∈ orl, ¬ (orl + qrl).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0 ⊦ vs0[(orl + qrl).last].next = vs[(orl + qrl).last].next ∧ vs0[vs[(orl + qrl).last].next].val = vs[vs[(orl + qrl).last].next].val ∧ ( (orl + qrl).last = vtail0 ∧ ps0[(orl + qrl).last].next = null ∧ owns0(vs[(orl + qrl).last].next) = Weak(tid) ∨ ((orl + qrl).last ∈ rl0 ∨ (orl + qrl).last ∈ qrl0) ∧ ps0[(orl + qrl).last].next = vs[(orl + qrl).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(orl + qrl).last].next ≠ vs0[(orl + qrl).last].next ⊃ oneweakowns(tid, vs[(orl + qrl).last].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [orl, qrl], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ listp(rl, vs, ps, owns) ∧ rl ≠ [] → ps[rl.last].next = null; (s) ⊦ ¬ dups([]); (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: orl, qrl

Proof step 95 from proof stable-E11 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof step 96 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[qrl.last].deqID = None, ps[vtail].next = null, vs[qrl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[vtail].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), vtail = (orl + qrl.butlast).last, orl + rl0 ≠ [], null ≠ vs[vtail].next, orl ≠ [], qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[vtail].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from vtail, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ vtail ∈ orl, ¬ vtail ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[vtail].next = vs[vtail].next ∧ vs0[vs[vtail].next].val = vs[vs[vtail].next].val ∧ (vtail = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs[vtail0].next) = Weak(tid) ∨ (vtail ∈ rl0 ∨ vtail ∈ qrl0) ∧ ps0[vtail].next = vs[vtail].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[vtail].next ≠ vs0[vtail].next ⊃ oneweakowns(tid, vs[vtail].next, owns0, vs0, ps0);noowns(tid, owns0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 97 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[qrl.last].deqID = None, vs[qrl.last].next = null, ps[(orl + qrl.butlast).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], null ≠ vs[(orl + qrl.butlast).last].next, orl ≠ [], qrl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp(orl + qrl, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl, ps), unmarkedp(qrl0, ps0), vtail0 ∈ rl0 + qrl0 from (orl + qrl.butlast).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl.tail, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ vs0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next ∧ vs0[vs[(orl + qrl.butlast).last].next].val = vs[vs[(orl + qrl.butlast).last].next].val ∧ ( (orl + qrl.butlast).last = vtail0 ∧ ps0[(orl + qrl.butlast).last].next = null ∧ owns0(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ ((orl + qrl.butlast).last ∈ rl0 ∨ (orl + qrl.butlast).last ∈ qrl0) ∧ ps0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(orl + qrl.butlast).last].next ≠ vs0[(orl + qrl.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-add, seq: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail), subst:[x, head, tail] → [qrl, phead1, orl0]

Additional information

Used simplifier rules: ⊦ x ≠ [] → (head = x.head ∧ tail = x.tail ↔ x = head + tail); (elim) Used terms: qrl, head, tail

Proof step 98 from proof stable-E11 (previous step) (back to tree)

qrl + rl = rl0 + qrl0, vs[qrl.last].deqID = None, ps[(orl + qrl.butlast).last].next = null, vs[qrl.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + qrl.butlast).last].next) = Weak(tid), qrl = phead1 + orl0, vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], null ≠ vs[(orl + qrl.butlast).last].next, orl ≠ [], qrl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + qrl, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + qrl, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + qrl, vhead, vs), noidRely(tid, orl + qrl, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from (orl + qrl.butlast).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl + qrl), ¬ dups((orl + rl0) + qrl0), ¬ dups(qrl), ¬ dups(rl), ¬ dups(orl), ¬ dups(rl0 + qrl0), ¬ dups(orl + rl0), ¬ dups(qrl0), ¬ dups(rl0), ¬ (orl + qrl.butlast).last ∈ orl, ¬ (orl + qrl.butlast).last ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null ⊦ vs0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next ∧ vs0[vs[(orl + qrl.butlast).last].next].val = vs[vs[(orl + qrl.butlast).last].next].val ∧ ( (orl + qrl.butlast).last = vtail0 ∧ ps0[(orl + qrl.butlast).last].next = null ∧ owns0(vs[(orl + qrl.butlast).last].next) = Weak(tid) ∨ ((orl + qrl.butlast).last ∈ rl0 ∨ (orl + qrl.butlast).last ∈ qrl0) ∧ ps0[(orl + qrl.butlast).last].next = vs[(orl + qrl.butlast).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(orl + qrl.butlast).last].next ≠ vs0[(orl + qrl.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + qrl.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] in-14: ⊦ a ' + x = 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)

Proof step 99 from proof stable-E11 (previous step) (back to tree)

(phead1 ' + orl0) + rl = rl0 + qrl0, ps[phead1].deqID = None, vs[(phead1 ' + orl0).last].deqID = None, ps[(orl + (phead1 ' + orl0).butlast).last].next = null, vs[(phead1 ' + orl0).last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(orl + (phead1 ' + orl0).butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + (phead1 ' + orl0).butlast).last ≠ phead1, null ≠ vs[(orl + (phead1 ' + orl0).butlast).last].next, orl ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + orl0, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + orl0, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + phead1 ' + orl0, vhead, vs), noidRely(tid, orl + phead1 ' + orl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + phead1 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(orl + (phead1 ' + orl0).butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from (orl + (phead1 ' + orl0).butlast).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + orl0), ¬ (orl + (phead1 ' + orl0).butlast).last ∈ orl0, ¬ (orl + (phead1 ' + orl0).butlast).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(orl0, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 ∈ rl0 ∨ phead1 ∈ qrl0 ⊦ vs0[(orl + (phead1 ' + orl0).butlast).last].next = vs[(orl + (phead1 ' + orl0).butlast).last].next ∧ vs0[vs[(orl + (phead1 ' + orl0).butlast).last].next].val = vs[vs[(orl + (phead1 ' + orl0).butlast).last].next].val ∧ ( (orl + (phead1 ' + orl0).butlast).last = vtail0 ∧ ps0[(orl + (phead1 ' + orl0).butlast).last].next = null ∧ owns0(vs[(orl + (phead1 ' + orl0).butlast).last].next) = Weak(tid) ∨ ((orl + (phead1 ' + orl0).butlast).last ∈ rl0 ∨ (orl + (phead1 ' + orl0).butlast).last ∈ qrl0) ∧ ps0[(orl + (phead1 ' + orl0).butlast).last].next = vs[(orl + (phead1 ' + orl0).butlast).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(orl + (phead1 ' + orl0).butlast).last].next ≠ vs0[(orl + (phead1 ' + orl0).butlast).last].next ⊃ oneweakowns(tid, vs[(orl + (phead1 ' + orl0).butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:bapp, seq: ⊦ y ≠ [] → (x + y).butlast = x + y.butlast, subst:[x, y] → [phead1 ', orl0], <all paths>

Additional information

Used simplifier rules: ⊦ a '.last = a; (s) ⊦ [] + x = x; (s) ⊦ unmarkedp([], vs); (s) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x.last ∈ x ↔ x ≠ []; (s) Used terms: phead1 ', orl0

Proof step 100 from proof stable-E11 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).butlast = x + y.butlast

A spec-lemma

Proof step 101 from proof stable-E11 (previous step) (back to tree)

(phead1 ' + orl0) + rl = rl0 + qrl0, vs[(phead1 ' + orl0).last].deqID = None, ps[phead1].deqID = None, vs[(phead1 ' + orl0).last].next = null, ps[(orl + phead1 ' + orl0.butlast).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, owns(vs[(orl + phead1 ' + orl0.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (orl + phead1 ' + orl0.butlast).last ≠ phead1, null ≠ vs[(orl + phead1 ' + orl0.butlast).last].next, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + orl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + orl0, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + phead1 ' + orl0, vhead, vs), noidRely(tid, orl + phead1 ' + orl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + phead1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(orl + phead1 ' + orl0.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), vtail0 ∈ rl0 + qrl0 from (orl + phead1 ' + orl0.butlast).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + orl0), ¬ (orl + phead1 ' + orl0.butlast).last ∈ orl0, ¬ (orl + phead1 ' + orl0.butlast).last ∈ orl, ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), phead1 ∈ rl0 ∨ phead1 ∈ qrl0, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vs0[(orl + phead1 ' + orl0.butlast).last].next = vs[(orl + phead1 ' + orl0.butlast).last].next ∧ vs0[vs[(orl + phead1 ' + orl0.butlast).last].next].val = vs[vs[(orl + phead1 ' + orl0.butlast).last].next].val ∧ ( (orl + phead1 ' + orl0.butlast).last = vtail0 ∧ ps0[(orl + phead1 ' + orl0.butlast).last].next = null ∧ owns0(vs[(orl + phead1 ' + orl0.butlast).last].next) = Weak(tid) ∨ ((orl + phead1 ' + orl0.butlast).last ∈ rl0 ∨ (orl + phead1 ' + orl0.butlast).last ∈ qrl0) ∧ ps0[(orl + phead1 ' + orl0.butlast).last].next = vs[(orl + phead1 ' + orl0.butlast).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(orl + phead1 ' + orl0.butlast).last].next ≠ vs0[(orl + phead1 ' + orl0.butlast).last].next ⊃ oneweakowns(tid, vs[(orl + phead1 ' + orl0.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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)

Proof step 102 from proof stable-E11 (previous step) (back to tree)

(phead1 ' + orl0) + rl = rl0 + qrl0, ps[phead1].deqID = None, vs[orl0.last].deqID = None, ps[(phead1 ' + orl0.butlast).last].next = null, vs[orl0.last].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(phead1 ' + orl0.butlast).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (phead1 ' + orl0.butlast).last ≠ phead1, null ≠ vs[(phead1 ' + orl0.butlast).last].next, orl ≠ [], orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + orl0, vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + orl0, vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + phead1 ' + orl0, vhead, vs), noidRely(tid, orl + phead1 ' + orl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + phead1 ' + orl0, vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead1 ' + orl0.butlast).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(orl0, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from (phead1 ' + orl0.butlast).last, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ (phead1 ' + orl0.butlast).last ∈ orl0, ¬ (phead1 ' + orl0.butlast).last ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(orl0, vs), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 ∈ rl0 ∨ phead1 ∈ qrl0 ⊦ vs0[(phead1 ' + orl0.butlast).last].next = vs[(phead1 ' + orl0.butlast).last].next ∧ vs0[vs[(phead1 ' + orl0.butlast).last].next].val = vs[vs[(phead1 ' + orl0.butlast).last].next].val ∧ ( (phead1 ' + orl0.butlast).last = vtail0 ∧ ps0[(phead1 ' + orl0.butlast).last].next = null ∧ owns0(vs[(phead1 ' + orl0.butlast).last].next) = Weak(tid) ∨ ((phead1 ' + orl0.butlast).last ∈ rl0 ∨ (phead1 ' + orl0.butlast).last ∈ qrl0) ∧ ps0[(phead1 ' + orl0.butlast).last].next = vs[(phead1 ' + orl0.butlast).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(phead1 ' + orl0.butlast).last].next ≠ vs0[(phead1 ' + orl0.butlast).last].next ⊃ oneweakowns(tid, vs[(phead1 ' + orl0.butlast).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic use patterns applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:last-elim, seq:x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a ', subst:[x, a, y] → [orl0, vtail, qrl]

Additional information

Used simplifier rules: x ≠ [] ⊦ a = x.last ∧ y = x.butlast ↔ x = y + a '; (elim) Used terms: orl0, vtail, y

Proof step 103 from proof stable-E11 (previous step) (back to tree)

(phead1 ' + orl0) + rl = rl0 + qrl0, vs[vtail].deqID = None, ps[phead1].deqID = None, vs[vtail].next = null, ps[(phead1 ' + qrl).last].next = null, dom vrvHp = dom prvHp, dom vrvHp0 = dom prvHp0, orl0 = qrl + vtail ', owns(vs[(phead1 ' + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (phead1 ' + qrl).last ≠ phead1, null ≠ vs[(phead1 ' + qrl).last].next, orl ≠ [], orl0 ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + orl0, vs, ps, vs0, ps0), listp(orl + phead1 ' + orl0, vs, ps, owns), listp((orl + rl0) + qrl0, vs0, ps0, owns0), markedp(orl, ps), markedp(orl, vs), markedp(orl, ps0), markedp(rl0, ps0), markedp(orl, vs0), markedp(rl0, vs0), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + phead1 ' + orl0, vhead, vs), noidRely(tid, orl + phead1 ' + orl0, vs, (orl + rl0) + qrl0, vs0), nonullRetRefs(orl + phead1 ' + orl0, vs, vretRefs, pretRefs), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), oneweakowns(tid, vs[(phead1 ' + qrl).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(orl0, ps), unmarkedp(qrl0, ps0), vtail0 ∈ rl0 + qrl0 from (phead1 ' + qrl).last, vhead0 ∈ (orl + rl0) + qrl0 from vhead, phead ∈ ps, phead ∈ vs, phead ∈ vs0, phead ∈ ps0, phead0 ∈ ps0, phead0 ∈ vs0, phead ∈ orl, dom prvHp ⊆ dom prvHp0, ¬ dups(orl0), ¬ dups(orl), ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + orl0), ¬ phead1 ∈ orl0, ¬ phead1 ∈ orl, ¬ (phead1 ' + qrl).last ∈ orl0, ¬ (phead1 ' + qrl).last ∈ orl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), 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), phead1 ∈ rl0 ∨ phead1 ∈ qrl0, vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), phead0 ∈ orl ∨ phead0 ∈ rl0, phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, orl.last = vhead ∧ unmarkedp(orl0, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(orl0, vs) ⊦ vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs[(phead1 ' + qrl).last].next].val = vs[vs[(phead1 ' + qrl).last].next].val ∧ ( (phead1 ' + qrl).last = vtail0 ∧ ps0[(phead1 ' + qrl).last].next = null ∧ owns0(vs[(phead1 ' + qrl).last].next) = Weak(tid) ∨ ((phead1 ' + qrl).last ∈ rl0 ∨ (phead1 ' + qrl).last ∈ qrl0) ∧ ps0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(phead1 ' + qrl).last].next ≠ vs0[(phead1 ' + qrl).last].next ⊃ oneweakowns(tid, vs[(phead1 ' + qrl).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ x + a ' ≠ []; (s)

Proof step 104 from proof stable-E11 (previous step) (back to tree)

(phead1 ' + qrl + vtail ') + rl = rl0 + qrl0, ps[phead1].deqID = None, vs[vtail].deqID = None, ps[vtail].deqID = None, ps[(phead1 ' + qrl).last].next = null, vs[vtail].next = null, dom vrvHp0 = dom prvHp0, dom vrvHp = dom prvHp, owns(vs[(phead1 ' + qrl).last].next) = Weak(tid), vretRefs(tid) = vretRefs0(tid), orl + rl0 ≠ [], (phead1 ' + qrl).last ≠ phead1, null ≠ vs[(phead1 ' + qrl).last].next, orl ≠ [], phead1 ≠ vtail, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), equalowns(vs, ps, owns, tid, vs0, ps0, owns0), equalrl(orl + phead1 ' + qrl + vtail ', vs, ps, vs0, ps0), listp((orl + rl0) + qrl0, vs0, ps0, owns0), listp(orl + phead1 ' + qrl + vtail ', vs, ps, owns), markedp(rl0, vs0), markedp(orl, vs0), markedp(rl0, ps0), markedp(orl, ps0), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), nextnottidRely(tid, vhead, vs, vhead0, vs0), noid(tid, orl + phead1 ' + qrl + vtail ', vhead, vs), noidRely(tid, orl + phead1 ' + qrl + vtail ', vs, (orl + rl0) + qrl0, vs0), nonullRetRefs((orl + rl0) + qrl0, vs0, vretRefs0, pretRefs0), nonullRetRefs(orl + phead1 ' + qrl + vtail ', vs, vretRefs, pretRefs), oneweakowns(tid, vs[(phead1 ' + qrl).last].next, owns, vs, ps), ownsRely(tid, owns, owns0), prvHpRely(vrvHp, prvHp, prvHp0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), rvownsrely(tid, rvowns, rvowns0, vrvHp), rvrely(tid, rvowns, vretRefs, vrvHp, vretRefs0, vrvHp0), unmarkedp(qrl0, ps0), unmarkedp(qrl, ps), phead ∈ orl, phead0 ∈ vs0, phead0 ∈ ps0, phead ∈ ps0, phead ∈ vs0, phead ∈ vs, phead ∈ ps, vhead0 ∈ (orl + rl0) + qrl0 from vhead, vtail0 ∈ rl0 + qrl0 from (phead1 ' + qrl).last, dom prvHp ⊆ dom prvHp0, ¬ dups(rl0), ¬ dups(qrl0), ¬ dups(orl + rl0), ¬ dups(rl0 + qrl0), ¬ dups(rl), ¬ dups((orl + rl0) + qrl0), ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ (phead1 ' + qrl).last ∈ orl, ¬ vtail ∈ qrl, ¬ vtail ∈ orl, ¬ phead1 ∈ qrl, ¬ phead1 ∈ orl, ¬ (phead1 ' + qrl).last ∈ 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), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead0 ∈ orl from phead ∨ phead0 ∈ rl0 ∨ phead0 ∈ qrl0, phead0 ∈ orl ∨ phead0 ∈ rl0, pretRefs(tid) = pretRefs0(tid) ∨ vretRefs0(tid) = pretRefs0(tid), (orl + rl0).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ (orl + rl0).butlast ≠ [] ∧ (orl + rl0).butlast.last = vhead0 ∧ phead0 ≠ (orl + rl0).last ∧ unmarkedp(qrl0, vs0), vtail0 = ((orl + rl0) + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = ((orl + rl0) + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null, phead1 ∈ rl0 ∨ phead1 ∈ qrl0, orl.last = vhead ∧ unmarkedp(qrl, vs) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ vs[phead1].deqID = None ∧ unmarkedp(qrl, vs) ⊦ vs0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next ∧ vs0[vs[(phead1 ' + qrl).last].next].val = vs[vs[(phead1 ' + qrl).last].next].val ∧ ( (phead1 ' + qrl).last = vtail0 ∧ ps0[(phead1 ' + qrl).last].next = null ∧ owns0(vs[(phead1 ' + qrl).last].next) = Weak(tid) ∨ ((phead1 ' + qrl).last ∈ rl0 ∨ (phead1 ' + qrl).last ∈ qrl0) ∧ ps0[(phead1 ' + qrl).last].next = vs[(phead1 ' + qrl).last].next) ∧ noid(tid, (orl + rl0) + qrl0, vhead0, vs0) ∧ (ps0[(phead1 ' + qrl).last].next ≠ vs0[(phead1 ' + qrl).last].next ⊃ oneweakowns(tid, vs[(phead1 ' + qrl).last].next, owns0, vs0, ps0) ;noowns(tid, owns0) )

Heuristic use patterns applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: list-last[reflist], name:lapp, seq: ⊦ y ≠ [] → (x + y).last = y.last, subst:[x, y] → [phead1 ', qrl], <all paths>

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ [] + x = x; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: phead1 ', qrl

Proof step 105 from proof stable-E11 (previous step) (back to tree)

⊦ y ≠ [] → (x + y).last = y.last

A spec-lemma

Proof Tree for stable-E11 (View conclusion)

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.

the proof tree