[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 step-D20-D25 (conclusion) (back to tree)

⊦ ( ( ls.nxt ≠ null ∧ ls.nxt = gs.ps[ls.first].next ∧ ls.optval = Val(gs.vs[ls.nxt].val) ∧ (gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success) ∧ (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) )) ∧ ( 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.first ∈ gs.orl ∧ gs.vhead ∈ gs.orl from ls.first) ∧ (ls.first ≠ ls.lst ∧ gs.vtail ∈ gs.orl + gs.qrl from ls.lst) ∧ ls.lst ∈ gs.orl + gs.qrl from ls.first ∧ (gs.vretRefs(ls.tid) = ls.rvref ∧ gs.pretRefs(ls.tid) = ls.rvref ∧ ls.rvref ∈ gs.vrvHp ∧ ls.rvref ≠ null) ∧ (gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs)) ∧ noowns(ls.tid, gs.owns)) ∧ pre(gs, ls, D20, a) ∧ pcstepf(gs, ls, D20, a) = D25 → ( lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val) ∧ ( gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed ((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noid (lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns)

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-D20-D25 (previous step) (back to tree)

ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, D20, a) = D25, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), pre(gs, ls, D20, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.orl, ls.first ∈ gs.orl, gs.vhead ∈ gs.orl from ls.first, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, ls.lst ∈ gs.orl + gs.qrl from ls.first, ls.rvref ∈ gs.vrvHp, ¬ dups(gs.orl + gs.qrl), gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid) → gs.vhead = ls.first ∧ ls.success, 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.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), (ls.success ⊃ gs.vs[ls.nxt].deqID = Some(ls.tid) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Claimed(ls.tid, ls.optval.val) ∧ (gs.ps[ls.nxt].deqID = None → gs.vhead = ls.first) ∧ noid(ls.tid, gs.orl + gs.qrl, ls.nxt, gs.vs) ;gs.vs[ls.nxt].deqID ≠ None ∧ noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs) ∧ gs.rvowns(gs.vretRefs(ls.tid)) = Pending(ls.tid) ), 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 ⊦ ( lstepf(gs, ls, D20, a).first ∈ gstepf(gs, ls, D20, a).orl ∧ lstepf(gs, ls, D20, a).nxt ≠ null ∧ lstepf(gs, ls, D20, a).nxt = gstepf(gs, ls, D20, a).ps[lstepf(gs, ls, D20, a).first].next ∧ gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].deqID ≠ None ∧ lstepf(gs, ls, D20, a).optval = Val(gstepf(gs, ls, D20, a).vs[lstepf(gs, ls, D20, a).nxt].val) ∧ ( gstepf(gs, ls, D20, a).vhead = lstepf(gs, ls, D20, a).first → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid)) = Claimed((gstepf(gs, ls, D20, a).ps ⊕ gstepf(gs, ls, D20, a).vs)[lstepf(gs, ls, D20, a).nxt].deqID.tid, lstepf(gs, ls, D20, a).optval.val))) ∧ ( listp (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).ps, gstepf(gs, ls, D20, a).owns) ∧ ¬ dups(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).ps) ∧ markedp(gstepf(gs, ls, D20, a).orl, gstepf(gs, ls, D20, a).vs) ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).ps) ∧ gstepf(gs, ls, D20, a).orl ≠ [] ∧ gstepf(gs, ls, D20, a).phead ∈ gstepf(gs, ls, D20, a).orl ∧ rvownerok(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs, gstepf(gs, ls, D20, a).vretRefs, gstepf(gs, ls, D20, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp, gstepf(gs, ls, D20, a).rvowns) ∧ allocrv(gstepf(gs, ls, D20, a).pretRefs, gstepf(gs, ls, D20, a).prvHp) ∧ dom gstepf(gs, ls, D20, a).vrvHp = dom gstepf(gs, ls, D20, a).prvHp ∧ ( gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next ≠ null ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID ≠ None → gstepf(gs, ls, D20, a).rvowns (gstepf(gs, ls, D20, a).vretRefs(gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].deqID.tid, gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).vhead].next].val)) ∧ ( gstepf(gs, ls, D20, a).orl.last = gstepf(gs, ls, D20, a).vhead ∧ (gstepf(gs, ls, D20, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, D20, a).qrl.tail, gstepf(gs, ls, D20, a).vs)) ∨ gstepf(gs, ls, D20, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, D20, a).orl.butlast.last = gstepf(gs, ls, D20, a).vhead ∧ gstepf(gs, ls, D20, a).phead ≠ gstepf(gs, ls, D20, a).orl.last ∧ unmarkedp(gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vs)) ∧ ( gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last ∨ gstepf(gs, ls, D20, a).qrl ≠ [] ∧ gstepf(gs, ls, D20, a).vtail = (gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl.butlast).last ∧ gstepf(gs, ls, D20, a).vs[gstepf(gs, ls, D20, a).qrl.last].deqID = None ∧ gstepf(gs, ls, D20, a).vs[(gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, D20, a).success ∧ gstepf(gs, ls, D20, a).rvowns(gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid)) = Pending(lstepf(gs, ls, D20, a).tid)) ∧ ( lstepf(gs, ls, D20, a).first ≠ lstepf(gs, ls, D20, a).lst ∧ gstepf(gs, ls, D20, a).vtail ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).lst) ∧ lstepf(gs, ls, D20, a).lst ∈ gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl from lstepf(gs, ls, D20, a).first ∧ ( gstepf(gs, ls, D20, a).vretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ gstepf(gs, ls, D20, a).pretRefs(lstepf(gs, ls, D20, a).tid) = lstepf(gs, ls, D20, a).rvref ∧ lstepf(gs, ls, D20, a).rvref ∈ gstepf(gs, ls, D20, a).vrvHp ∧ lstepf(gs, ls, D20, a).rvref ≠ null) ∧ nextnottid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noid(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).orl + gstepf(gs, ls, D20, a).qrl, gstepf(gs, ls, D20, a).vhead, gstepf(gs, ls, D20, a).vs) ∧ noowns(lstepf(gs, ls, D20, a).tid, gstepf(gs, ls, D20, a).owns)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Val(val).val = val; (s) ⊦ gstepf(gs, ls, D20, τ) = gs; (s) ⊦ lstepf(gs, ls, D20, τ) = ls; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ pre(gs, ls, D20, a) ↔ a = τ; (s) ⊦ D21 ≠ D25; (s) ⊦ pcstepf(gs, ls, D20, a) = (ls.success ⊃ D21;D25); (s)

Proof step 3 from proof step-D20-D25 (previous step) (back to tree)

ls.nxt = gs.ps[ls.first].next, ls.optval = Val(gs.vs[ls.nxt].val), gs.pretRefs(ls.tid) = ls.rvref, gs.rvowns(ls.rvref) = Pending(ls.tid), gs.vretRefs(ls.tid) = ls.rvref, dom gs.vrvHp = dom gs.prvHp, gs.vs[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, gs.orl ≠ [], ls.rvref ≠ null, allocrv(gs.pretRefs, gs.prvHp), allocrv(gs.vretRefs, gs.vrvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.vs), markedp(gs.orl, gs.ps), noid(ls.tid, gs.orl + gs.qrl, ls.first, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), noowns(ls.tid, gs.owns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.rvref ∈ gs.vrvHp, gs.vtail ∈ gs.orl + gs.qrl from ls.lst, gs.vhead ∈ gs.orl from ls.first, ls.first ∈ gs.orl, gs.phead ∈ gs.orl, ls.first ∈ gs.vs, gs.phead ∈ gs.vs, ls.first ∈ gs.ps, gs.phead ∈ gs.ps, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.qrl), gs.vhead ≠ ls.first → nextnottid(ls.tid, gs.vhead, gs.vs), 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), ls.lst ∈ gs.orl from ls.first ∨ ls.lst ∈ gs.qrl, gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ gs.qrl ≠ [] ∧ gs.vs[gs.qrl.head].deqID = Some(ls.tid), (gs.vhead = ls.first → gs.rvowns(gs.vretRefs((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid)) = Claimed((gs.ps ⊕ gs.vs)[ls.nxt].deqID.tid, gs.vs[ls.nxt].val)) ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs)

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 step-D20-D25 (previous step) (back to tree)

ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, ls.first ∈ ps, phead ∈ vs, ls.first ∈ vs, phead ∈ orl, ls.first ∈ orl, vhead ∈ orl from ls.first, vtail ∈ orl + qrl from ls.lst, ls.rvref ∈ vrvHp, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl ⊦ (vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val)) ∧ nextnottid(ls.tid, vhead, vs) ∧ noid(ls.tid, orl + qrl, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.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] 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 5 from proof step-D20-D25 (previous step) (back to tree)

ls.nxt = ps[ls.first].next, ls.optval = Val(vs[ls.nxt].val), dom vrvHp = dom prvHp, pretRefs(ls.tid) = ls.rvref, rvowns(ls.rvref) = Pending(ls.tid), vretRefs(ls.tid) = ls.rvref, vs[ls.nxt].deqID ≠ None, ls.first ≠ ls.lst, ls.nxt ≠ null, ls.rvref ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(ls.tid, orl + qrl, ls.first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(ls.tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.rvref ∈ vrvHp, vtail ∈ orl + qrl from ls.lst, vhead ∈ orl from ls.first, ls.first ∈ orl, phead ∈ orl, ls.first ∈ vs, phead ∈ vs, ls.first ∈ ps, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ ls.first → nextnottid(ls.tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ls.lst ∈ orl from ls.first ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(ls.tid), (vhead = ls.first → rvowns(vretRefs((ps ⊕ vs)[ls.nxt].deqID.tid)) = Claimed((ps ⊕ vs)[ls.nxt].deqID.tid, vs[ls.nxt].val)) ∧ nextnottid(ls.tid, vhead, vs) ∧ noid(ls.tid, orl + qrl, vhead, vs)

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 6 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = ps[first].next, optval = Val(vs[nxt].val), pretRefs(tid) = rvref, rvowns(rvref) = Pending(tid), ¬ success, vretRefs(tid) = rvref, vs[nxt].deqID ≠ None, first ≠ lst, nxt ≠ null, orl ≠ [], rvref ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, first ∈ ps, phead ∈ vs, first ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, rvref ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl ⊦ (vhead = first → rvowns(vretRefs((ps ⊕ vs)[nxt].deqID.tid)) = Claimed((ps ⊕ vs)[nxt].deqID.tid, vs[nxt].val)) ∧ nextnottid(tid, vhead, vs) ∧ noid(tid, orl + qrl, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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-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 step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), (vhead = first → rvowns(vretRefs((ps ⊕ vs)[ps[first].next].deqID.tid)) = Claimed((ps ⊕ vs)[ps[first].next].deqID.tid, vs[ps[first].next].val)) ∧ nextnottid(tid, vhead, vs) ∧ noid(tid, orl + qrl, vhead, vs)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oplus-sel, seq: ⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r]), subst:[ps, vs, r] → [ps, vs, ps[first].next], <all paths>

Additional information

Used terms: ps, vs, ps[first].next

Proof step 8 from proof step-D20-D25 (previous step) (back to tree)

⊦ (ps ⊕ vs)[r] = (r ∈ vs ⊃ vs[r];ps[r])

A spec-lemma

Proof step 9 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, phead ∈ orl, first ∈ orl, vhead ∈ orl from first, vtail ∈ orl + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl from first ∨ lst ∈ qrl ⊦ ( vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val)) ∧ nextnottid(tid, vhead, vs) ∧ noid(tid, orl + qrl, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps, orl, owns, first, qrl, vs

Proof step 10 from proof step-D20-D25 (previous step) (back to tree)

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

A spec-lemma

Proof step 11 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, orl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), noid(tid, orl + qrl, first, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ orl + qrl from lst, vhead ∈ orl from first, first ∈ orl, phead ∈ orl, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), listp(orl + qrl, vs, ps, owns) ∧ first ∈ orl → (∃ rl1, rl2. orl = rl1 + first ' + rl2 ∧ listp(first ' + rl2 + qrl, vs, ps, owns)), lst ∈ orl from first ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), ( vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val)) ∧ nextnottid(tid, vhead, vs) ∧ noid(tid, orl + qrl, vhead, vs)

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] ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (x + a ' + y).butlast = x + (a ' + y).butlast; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' + y ≠ []; (s) ⊦ x = y + a ' + z → a ∈ x; (s)

Proof step 12 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead ≠ first → nextnottid(tid, vhead, vs), (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, vhead = first ∨ vhead ∈ rl2, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ ( vhead = first → rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) = Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val)) ∧ nextnottid(tid, vhead, vs) ∧ noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Proof step 13 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vhead = first, vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 14 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), (first ' + rl2).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

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 15 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = [], rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ unmarkedp([], vs); (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ ¬ a ∈ []; (s) ⊦ [] + x = x; (s) ⊦ a '.last = a; (s) ⊦ a '.butlast = []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 16 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[qrl.head].deqID ≠ Some(tid), ps[first].next ≠ null, first ≠ lst, qrl ≠ [], rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + qrl, vs, ps, owns), listp(rl1 + first ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), lst ∈ ps, lst ∈ vs, lst ∈ qrl, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first, vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, unmarkedp(qrl.tail, vs) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs) ⊦

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, phead0, rl]

Additional information

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

Proof step 17 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), qrl = phead0 + rl, rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, vs[phead0].deqID ≠ Some(tid), ps[first].next ≠ null, first ≠ lst, qrl ≠ [], rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + qrl, vs, ps, owns), listp(first ' + qrl, vs, ps, owns), markedp(rl1, ps), markedp(rl1, vs), noid(tid, rl1 + first ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + qrl from lst, vretRefs(tid) ∈ vrvHp, lst ∈ qrl, lst ∈ vs, lst ∈ ps, ¬ dups(qrl), ¬ dups(rl1), ¬ dups(rl1 + qrl), ¬ first ∈ rl1, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), unmarkedp(rl, vs) ∨ rl1 ≠ [] ∧ rl1.last = first ∧ phead ≠ rl1.last ∧ unmarkedp(qrl, vs), vtail = qrl.last ∨ vtail = (first ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ⊦

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 → (b ' + x).last = x.last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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 ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ' + x ≠ []; (s)

Proof step 18 from proof step-D20-D25 (previous step) (back to tree)

ps[vs[first].next].deqID = None, ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[vs[first].next].deqID ≠ Some(tid), vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, lst ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + rl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), noid(tid, rl1 + first ' + vs[first].next ' + rl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + rl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), unmarkedp(rl, ps), unmarkedp(rl, vs), lst ∈ ps, lst ∈ vs, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + rl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, lst ∈ rl, ¬ dups(rl1 + rl), ¬ dups(rl1), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ first ∈ rl, phead ∈ rl1 ∨ phead = first, vtail = rl.last ∨ vtail = (first ' + (vs[first].next ' + rl).butlast).last ∧ vs[rl.last].deqID = None ∧ vs[rl.last].next = null ⊦

User applied rule constructor cut

And closed the goal!

Rule argument

var: rl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + [] = x; (s) ⊦ ¬ a ∈ []; (s)

Proof step 19 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = first0 + rl, rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, rvowns(vretRefs((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid)) ≠ Claimed((ps[first].next ∈ vs ⊃ vs[ps[first].next];ps[ps[first].next]).deqID.tid, vs[ps[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 20 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, (vs[first].next ' + rl).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = first ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl ∨ phead = first ∨ phead ∈ rl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: opttid, name:elim-Some, seq: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)), subst:[opttid, tid] → [vs[vs[first].next].deqID, tid0]

Additional information

Used simplifier rules: ⊦ some?(opttid) → (tid = opttid.tid ↔ opttid = Some(tid)); (elim) Used terms: vs[vs[first].next].deqID, tid0

Proof step 21 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl + qrl), ¬ dups(rl1), ¬ dups(rl + qrl), ¬ dups(rl1 + rl), ¬ dups(qrl), ¬ dups(rl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, phead ∈ rl ∨ phead = first ∨ phead ∈ rl1, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[first].next ' + rl).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = first ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ some?(Some(tid)); (s) ⊦ None ≠ Some(tid); (s)

Proof step 22 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, phead ∈ rl ∨ phead = first ∨ phead ∈ rl1, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (vs[first].next ' + rl).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = first ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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 [], +;; ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ a + x = a ' + x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ Some(tid).tid = tid; (s)

Proof step 23 from proof step-D20-D25 (previous step) (back to tree)

vs[vs[first].next].deqID = Some(tid0), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rl = [], rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), rvowns(vretRefs(tid)) = Pending(tid), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, (vs[first].next ' + rl).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = first ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl ∨ phead = first ∨ phead ∈ rl1 ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a '.last = a; (s) ⊦ x + [] = x; (s) ⊦ a '.butlast = []; (s) ⊦ [] + x = x; (s) ⊦ ¬ a ∈ []; (s) ⊦ ¬ dups([]); (s) ⊦ markedp([], vs); (s)

Proof step 24 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[vs[first].next].deqID = Some(tid0), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), rvowns(vretRefs(tid0)) = Claimed(tid0, vs[vs[first].next].val), vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ vs[first].next, rvowns(vretRefs((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid)) ≠ Claimed((vs[first].next ∈ vs ⊃ vs[vs[first].next];ps[vs[first].next]).deqID.tid, vs[vs[first].next].val), vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + qrl, vs, ps, owns), listp(rl1 + first ' + vs[first].next ' + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl1, ps), noid(tid, rl1 + first ' + vs[first].next ' + qrl, first, vs), nonullRetRefs(rl1 + first ' + vs[first].next ' + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + vs[first].next ' + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + qrl), ¬ dups(rl1), ¬ dups(qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, phead = first ∨ phead ∈ rl1, lst = vs[first].next ∨ lst ∈ qrl, vtail = (vs[first].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule constructor cut

And closed the goal!

Rule argument

var: qrl

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (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) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ' + x ≠ []; (s) ⊦ a + x = a ' + x; (s) ⊦ (a ' + x).head = a; (s) listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) ⊦ unmarkedp([], vs); (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) ⊦ ¬ a ∈ []; (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s)

Proof step 25 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ nextnottid(tid, vhead, vs), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 26 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(qrl), ¬ dups(rl2), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl1), ¬ dups(rl2 + qrl), ¬ dups(rl1 + rl2), ¬ nextnottid(tid, first, vs), ¬ first ∈ rl1, ¬ first ∈ rl2, ¬ first ∈ qrl, vs[first].next ≠ null ∧ vs[vs[first].next].deqID ≠ None → rvowns(vretRefs(vs[vs[first].next].deqID.tid)) = Claimed(vs[vs[first].next].deqID.tid, vs[vs[first].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = first ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = first ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:nextnottid-def, seq:⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid), subst:[tid, vhead, vs] → [tid, first, vs], <all paths>

Additional information

Used simplifier rules: ⊦ None ≠ Some(tid); (s) ⊦ Some(tid).tid = tid; (s) ⊦ Pending(tid) ≠ Claimed(tid0, val); (s) Used terms: tid, first, vs

Proof step 27 from proof step-D20-D25 (previous step) (back to tree)

⊦ nextnottid(tid, vhead, vs) ↔ vs[vhead].next ≠ null → vs[vs[vhead].next].deqID ≠ Some(tid)

A spec-lemma

Proof step 28 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vhead ≠ first → nextnottid(tid, vhead, vs), vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, vhead = first ∨ vhead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, (first ' + rl2).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ (first ' + rl2).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] ⊦ a ∈ x → (b ' + x).last = x.last; (s)

Proof step 29 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), listp(first ' + rl2 + qrl, vs, ps, owns), markedp(rl2, ps), markedp(rl1, ps), markedp(rl2, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[first].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, vretRefs(tid) ∈ vrvHp, vhead ∈ rl2, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ rl2 ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ [] + x = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ a ∈ []; (s)

Proof step 30 from proof step-D20-D25 (previous step) (back to tree)

dom vrvHp = dom prvHp, pretRefs(tid) = vretRefs(tid), rl2 = first0 + rl, rvowns(vretRefs(tid)) = Pending(tid), vs[ps[first].next].deqID ≠ None, ps[first].next ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(first ' + rl2 + qrl, vs, ps, owns), listp((rl1 + first ' + rl2) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl2, vs), markedp(rl1, ps), markedp(rl2, ps), nextnottid(tid, vhead, vs), noid(tid, (rl1 + first ' + rl2) + qrl, first, vs), nonullRetRefs((rl1 + first ' + rl2) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[first].deqID), some?(ps[first].deqID), unmarkedp(qrl, ps), vhead ∈ rl2, vretRefs(tid) ∈ vrvHp, vtail ∈ (rl1 + first ' + rl2) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl1 + rl2), ¬ dups(rl2 + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl2 + qrl), ¬ dups(rl2), ¬ dups(qrl), ¬ noid(tid, (rl1 + first ' + rl2) + qrl, vhead, vs), ¬ first ∈ qrl, ¬ first ∈ rl2, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), rl2.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ rl1 + (first ' + rl2).butlast ≠ [] ∧ (rl1 + (first ' + rl2).butlast).last = vhead ∧ phead ≠ rl2.last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead ∈ rl2, lst ∈ rl2 ∨ lst ∈ qrl, vtail = (first ' + rl2 + qrl).last ∨ qrl ≠ [] ∧ vtail = (first ' + rl2 + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a + x = a ' + x; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ (a ' + b ' + x).butlast = a ' + (b ' + x).butlast; (s) ⊦ x + a ' + y ≠ []; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) ⊦ dups(a ' + x) ↔ a ∈ x ∨ dups(x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ some?(opttid) → opttid ≠ None; (as) ⊦ 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) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s)

Proof step 31 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[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[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs], <all paths>

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, first, vs

Proof step 32 from proof step-D20-D25 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 33 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from first → vs[r0].deqID ≠ Some(tid), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 34 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ noid(tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-def, seq:⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)), subst:[tid, rl, r, vs] → [tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs], <all paths>

Additional information

Used terms: tid, rl1 + first ' + (vs[first].next ' + rl) + qrl, vhead, vs

Proof step 35 from proof step-D20-D25 (previous step) (back to tree)

⊦ noid(tid, rl, r, vs) ↔ (∀ r0. r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid))

A spec-lemma

Proof step 36 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), ∃ r0. ¬(r0 ≠ vhead ∧ r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from vhead → vs[r0].deqID ≠ Some(tid)), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 37 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from vhead, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), ∀ r0. r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: r0

Proof step 38 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from vhead, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl) → vs[r0].deqID ≠ Some(tid), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from vhead, vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[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[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [rl1, first ' + (vs[first].next ' + rl) + qrl, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ∈ x ∧ a ∈ y → dups(x + y); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: rl1, first ' + (vs[first].next ' + rl) + qrl, vhead

Proof step 40 from proof step-D20-D25 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 41 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, r0 ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from vhead, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 42 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, r0 ∈ first ' + vs[first].next ' + rl + qrl from vhead, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[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[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [first ', vs[first].next ' + rl + qrl, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: first ', vs[first].next ' + rl + qrl, vhead

Proof step 43 from proof step-D20-D25 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 44 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), r0 ∈ first ' + vs[first].next ' + rl + qrl from vhead, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ first ', ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 45 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vhead ≠ first, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, r0 ∈ vs[first].next ' + rl + qrl from vhead, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[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[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, vhead = vs[first].next ∨ vhead ∈ rl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:from-append-fst, seq: ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl, subst:[orl, qrl, r] → [vs[first].next ', rl + qrl, vhead], <all paths>

Additional information

Used simplifier rules: ⊦ a ∈ b ' ↔ a = b; (s) ⊦ r ' from r0 = (r = r0 ⊃ r ';[]); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used terms: vs[first].next ', rl + qrl, vhead

Proof step 46 from proof step-D20-D25 (previous step) (back to tree)

⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl

A spec-lemma

Proof step 47 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vhead ≠ first, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), r0 ∈ vs[first].next ' + rl + qrl from vhead, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ vs[first].next ', ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vhead = vs[first].next ∨ vhead ∈ rl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, (vs[first].next ' + rl).last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ (vs[first].next ' + rl).last ∧ unmarkedp(qrl, vs) ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ r ∈ orl → orl + qrl from r = (orl from r) + qrl; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s)

Proof step 48 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, r0 ≠ vhead, vhead ≠ first, vhead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, vhead ∈ rl, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r0 ∈ rl from vhead ∨ r0 ∈ qrl, rl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ (first ' + (vs[first].next ' + rl).butlast).last = vhead ∧ phead ≠ rl.last ∧ unmarkedp(qrl, vs) ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 61

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] rl ≠ [] ⊦ ¬ dups(rl) → rl from rl.last = rl.last '; (s) ⊦ a ∈ b ' ↔ a = b; (s)

Proof step 49 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), (first ' + (vs[first].next ' + rl).butlast).last = vhead, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ rl.last, r0 ≠ vhead, vhead ≠ first, vhead ≠ vs[first].next, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, vhead, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), vhead ∈ rl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ vhead ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), r0 ∈ rl from vhead ∨ r0 ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 50 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, (first ' + (vs[first].next ' + rl).butlast).last ≠ first, (first ' + (vs[first].next ' + rl).butlast).last ≠ vs[first].next, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ rl.last, r0 ≠ (first ' + (vs[first].next ' + rl).butlast).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, (first ' + (vs[first].next ' + rl).butlast).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, (first ' + (vs[first].next ' + rl).butlast).last ∈ rl, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ (first ' + (vs[first].next ' + rl).butlast).last ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[(first ' + (vs[first].next ' + rl).butlast).last].next ≠ null ∧ vs[vs[(first ' + (vs[first].next ' + rl).butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + (vs[first].next ' + rl).butlast).last].next].deqID.tid)) = Claimed (vs[vs[(first ' + (vs[first].next ' + rl).butlast).last].next].deqID.tid, vs[vs[(first ' + (vs[first].next ' + rl).butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r0 ∈ rl from (first ' + (vs[first].next ' + rl).butlast).last ∨ r0 ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

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] → [vs[first].next ', rl], <all paths>

Additional information

Used simplifier rules: ⊦ a '.butlast = []; (s) ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs[first].next ', rl

Proof step 51 from proof step-D20-D25 (previous step) (back to tree)

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

A spec-lemma

Proof step 52 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, (first ' + vs[first].next ' + rl.butlast).last ≠ first, (first ' + vs[first].next ' + rl.butlast).last ≠ vs[first].next, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ rl.last, r0 ≠ (first ' + vs[first].next ' + rl.butlast).last, rl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, (first ' + vs[first].next ' + rl.butlast).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), (first ' + vs[first].next ' + rl.butlast).last ∈ rl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ (first ' + vs[first].next ' + rl.butlast).last ∈ rl1, ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, vs[(first ' + vs[first].next ' + rl.butlast).last].next ≠ null ∧ vs[vs[(first ' + vs[first].next ' + rl.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(first ' + vs[first].next ' + rl.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(first ' + vs[first].next ' + rl.butlast).last].next].deqID.tid, vs[vs[(first ' + vs[first].next ' + rl.butlast).last].next].val), r0 ∈ rl from (first ' + vs[first].next ' + rl.butlast).last ∨ r0 ∈ qrl, vtail = (vs[first].next ' + rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (vs[first].next ' + rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] ⊦ (b ' + a ' + x).last = (a ' + x).last; (s) ⊦ y ≠ [] → (x + y + z).last = (y + z).last; (s)

Proof step 53 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, (vs[first].next ' + rl.butlast).last ≠ first, (vs[first].next ' + rl.butlast).last ≠ vs[first].next, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ rl.last, r0 ≠ (vs[first].next ' + rl.butlast).last, rl ≠ [], vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + rl + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), markedp(rl1, vs), markedp(rl, vs), markedp(rl1, ps), markedp(rl, ps), nextnottid(tid, (vs[first].next ' + rl.butlast).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, (vs[first].next ' + rl.butlast).last ∈ rl, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ (vs[first].next ' + rl.butlast).last ∈ rl1, vs[(vs[first].next ' + rl.butlast).last].next ≠ null ∧ vs[vs[(vs[first].next ' + rl.butlast).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + rl.butlast).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + rl.butlast).last].next].deqID.tid, vs[vs[(vs[first].next ' + rl.butlast).last].next].val), phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, vtail = (rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, r0 ∈ rl from (vs[first].next ' + rl.butlast).last ∨ r0 ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl)

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] → [rl, vtail0, qrl0]

Additional information

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

Proof step 54 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rl = qrl0 + vtail0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, (vs[first].next ' + qrl0).last ≠ first, (vs[first].next ' + qrl0).last ≠ vs[first].next, vs[first].next ≠ null, first ≠ vs[first].next, first ≠ null, first ≠ lst, phead ≠ vtail0, r0 ≠ (vs[first].next ' + qrl0).last, rl ≠ [], vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, ps, owns), listp(vs[first].next ' + rl + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, (vs[first].next ' + qrl0).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + rl) + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), (vs[first].next ' + qrl0).last ∈ rl, first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + rl) + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl), ¬ dups(qrl), ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(rl1), ¬ dups(rl1 + rl + qrl), ¬ weak?(vs[first].deqID), ¬ first ∈ rl, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ (vs[first].next ' + qrl0).last ∈ rl1, vs[(vs[first].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl0).last].next].val), r0 ∈ rl from (vs[first].next ' + qrl0).last ∨ r0 ∈ qrl, vtail = (rl + qrl).last ∨ qrl ≠ [] ∧ vtail = (rl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ rl ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 55 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, (vs[first].next ' + qrl0).last ≠ first, (vs[first].next ' + qrl0).last ≠ vs[first].next, vs[first].next ≠ null, vs[first].next ≠ vtail0, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, r0 ≠ (vs[first].next ' + qrl0).last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, (vs[first].next ' + qrl0).last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ (vs[first].next ' + qrl0).last ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, vs[(vs[first].next ' + qrl0).last].next ≠ null ∧ vs[vs[(vs[first].next ' + qrl0).last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[(vs[first].next ' + qrl0).last].next].deqID.tid)) = Claimed(vs[vs[(vs[first].next ' + qrl0).last].next].deqID.tid, vs[vs[(vs[first].next ' + qrl0).last].next].val), r0 ∈ qrl0 + vtail0 ' from (vs[first].next ' + qrl0).last ∨ r0 ∈ qrl, (vs[first].next ' + qrl0).last ∈ qrl0 ∨ (vs[first].next ' + qrl0).last = vtail0, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ qrl0 ∨ r0 = vtail0 ∨ r0 ∈ qrl)

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] → [vs[first].next ', qrl0], <all paths>

Additional information

Used simplifier rules: ⊦ x + [] = x; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a '.last = a; (s) Used terms: vs[first].next ', qrl0

Proof step 56 from proof step-D20-D25 (previous step) (back to tree)

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

A spec-lemma

Proof step 57 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, qrl0.last ≠ first, qrl0.last ≠ vs[first].next, vs[first].next ≠ null, vs[first].next ≠ vtail0, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ qrl0.last, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(vs[first].next ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, qrl0.last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ qrl0.last ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), lst = vs[first].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl0, qrl0.last ∈ qrl0 ∨ qrl0.last = vtail0, r0 ∈ qrl0 + vtail0 ' from qrl0.last ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ qrl0 ∨ r0 = vtail0 ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ x.last ∈ x ↔ x ≠ []; (s)

Proof step 58 from proof step-D20-D25 (previous step) (back to tree)

vs[r0].deqID = Some(tid), ps[first].deqID = vs[first].deqID, ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, qrl0.last ≠ first, qrl0.last ≠ vs[first].next, vs[first].next ≠ null, vs[first].next ≠ vtail0, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, qrl0 ≠ [], r0 ≠ qrl0.last, vretRefs(tid) ≠ null, allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(vs[first].next ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(rl1, vs), markedp(qrl0, vs), markedp(rl1, ps), markedp(qrl0, ps), nextnottid(tid, qrl0.last, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), some?(vs[vs[first].next].deqID), some?(ps[vs[first].next].deqID), some?(vs[first].deqID), some?(vs[vtail0].deqID), some?(ps[vtail0].deqID), unmarkedp(qrl, vs), unmarkedp(qrl, ps), vretRefs(tid) ∈ vrvHp, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl from lst, phead ∈ vs, phead ∈ ps, first ∈ vs, first ∈ ps, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ qrl0.last ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, vs[qrl0.last].next ≠ null ∧ vs[vs[qrl0.last].next].deqID ≠ None → rvowns(vretRefs(vs[vs[qrl0.last].next].deqID.tid)) = Claimed(vs[vs[qrl0.last].next].deqID.tid, vs[vs[qrl0.last].next].val), r0 ∈ qrl0 + vtail0 ' from qrl0.last ∨ r0 ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl0, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst = vs[first].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl ⊦ qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid), r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ qrl0 ∨ r0 = vtail0 ∨ r0 ∈ qrl)

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] → [qrl0, phead0, rl]

Additional information

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

Proof step 59 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), qrl0 = rl + phead0 ', rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, vs[first].next ≠ null, vs[first].next ≠ vtail0, first ≠ vs[first].next, first ≠ null, first ≠ lst, first ≠ vtail0, phead ≠ vtail0, phead0 ≠ first, phead0 ≠ vs[first].next, qrl0 ≠ [], r0 ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, ps, owns), listp(vs[first].next ' + (qrl0 + vtail0 ') + qrl, vs, ps, owns), markedp(qrl0, ps), markedp(rl1, ps), markedp(qrl0, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[vtail0].deqID), some?(vs[vtail0].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + qrl0 + vtail0 ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups((rl1 + qrl0) + qrl), ¬ dups(rl1), ¬ dups(qrl0 + qrl), ¬ dups(rl1 + qrl0), ¬ dups(qrl), ¬ dups(qrl0), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl1, ¬ first ∈ rl1, ¬ phead0 ∈ rl1, ¬ vtail0 ∈ qrl0, ¬ vtail0 ∈ rl1, ¬ vtail0 ∈ qrl, ¬ first ∈ qrl0, ¬ first ∈ qrl, ¬ vs[first].next ∈ qrl, ¬ vs[first].next ∈ qrl0, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst = vs[first].next ∨ lst ∈ qrl0 ∨ lst = vtail0 ∨ lst ∈ qrl, vtail = (vtail0 ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (vtail0 ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ qrl0, r0 ∈ qrl0 + vtail0 ' from phead0 ∨ r0 ∈ qrl ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ qrl0 ∨ r0 = vtail0 ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(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] listp-twoin: ⊦ listp(rl + r ' + r0 ' + rl0, vs, ps, owns) → ps[r].next = r0; (forward) from specification DMSQ a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ r ' + rl from r = r ' + rl; (s) ⊦ ¬ r ∈ orl → orl + qrl from r = qrl from r; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ ¬ a ∈ x ∧ ¬ a ∈ y → (dups(x + a ' + y) ↔ dups(x + y)); (s) ⊦ dups(x + a ' + y) ↔ a ∈ x ∨ a ∈ y ∨ dups(x + y); (ws) ⊦ markedp(r ', vs) ↔ some?(vs[r].deqID); (s) ⊦ markedp(rl + rl0, vs) ↔ markedp(rl, vs) ∧ markedp(rl0, vs); (s) ⊦ x + a ' ≠ []; (s)

Proof step 60 from proof step-D20-D25 (previous step) (back to tree)

ps[first].deqID = vs[first].deqID, vs[r0].deqID = Some(tid), ps[first].next = vs[first].next, ps[first].val = vs[first].val, dom vrvHp = dom prvHp, owns(first) = None, pretRefs(tid) = vretRefs(tid), rvowns(vretRefs(tid)) = Pending(tid), vs[vs[first].next].deqID ≠ None, ps[phead0].next ≠ phead0, vs[first].next ≠ ps[phead0].next, vs[first].next ≠ null, first ≠ ps[phead0].next, first ≠ lst, first ≠ null, first ≠ vs[first].next, phead ≠ ps[phead0].next, phead0 ≠ vs[first].next, phead0 ≠ first, r0 ≠ phead0, vretRefs(tid) ≠ null, allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(rl1 + first ' + (vs[first].next ' + (rl + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), listp(vs[first].next ' + ((rl + phead0 ') + ps[phead0].next ') + qrl, vs, ps, owns), markedp(rl, ps), markedp(rl1, ps), markedp(rl, vs), markedp(rl1, vs), nextnottid(tid, phead0, vs), nonullRetRefs(rl1 + first ' + (vs[first].next ' + (rl + phead0 ') + ps[phead0].next ') + qrl, vs, vretRefs, pretRefs), noowns(tid, owns), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), some?(ps[phead0].deqID), some?(vs[phead0].deqID), some?(ps[ps[phead0].next].deqID), some?(vs[ps[phead0].next].deqID), some?(vs[first].deqID), some?(ps[vs[first].next].deqID), some?(vs[vs[first].next].deqID), unmarkedp(qrl, ps), unmarkedp(qrl, vs), first ∈ ps, first ∈ vs, phead ∈ ps, phead ∈ vs, vtail ∈ rl1 + first ' + (vs[first].next ' + (rl + phead0 ') + ps[phead0].next ') + qrl from lst, vretRefs(tid) ∈ vrvHp, ¬ dups(rl1 + rl), ¬ dups(rl + qrl), ¬ dups(qrl), ¬ dups(rl), ¬ dups(rl1), ¬ dups((rl1 + rl) + qrl), ¬ weak?(vs[first].deqID), ¬ vs[first].next ∈ rl, ¬ vs[first].next ∈ qrl, ¬ first ∈ qrl, ¬ first ∈ rl, ¬ ps[phead0].next ∈ qrl, ¬ ps[phead0].next ∈ rl1, ¬ ps[phead0].next ∈ rl, ¬ phead0 ∈ rl1, ¬ first ∈ rl1, ¬ vs[first].next ∈ rl1, ¬ phead0 ∈ qrl, ¬ phead0 ∈ rl, vs[phead0].next ≠ null ∧ vs[vs[phead0].next].deqID ≠ None → rvowns(vretRefs(vs[vs[phead0].next].deqID.tid)) = Claimed(vs[vs[phead0].next].deqID.tid, vs[vs[phead0].next].val), lst = vs[first].next ∨ lst ∈ rl ∨ lst = phead0 ∨ lst = ps[phead0].next ∨ lst ∈ qrl, phead ∈ rl1 ∨ phead = first ∨ phead = vs[first].next ∨ phead ∈ rl ∨ phead = phead0, r0 = ps[phead0].next ∨ r0 ∈ qrl, vtail = (ps[phead0].next ' + qrl).last ∨ qrl ≠ [] ∧ vtail = (ps[phead0].next ' + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ r0 ≠ first ∧ (r0 = vs[first].next ∨ r0 ∈ rl ∨ r0 = ps[phead0].next ∨ r0 ∈ qrl), qrl ≠ [] ∧ vs[qrl.head].deqID = Some(tid)

User applied rule case distinction

And closed the goal!

Rule argument

pos: left 72

Additional information

Used simplifier rules: ⊦ a ∈ x → (b ' + x).last = x.last; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof Tree for step-D20-D25 (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