[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-E9-E10 (conclusion) (back to tree)

⊦ ( (gs.owns(ls.node) = Some(ls.tid) ∧ ls.nxt = null ∧ ls.lst ∈ gs.orl + gs.qrl ∧ (gs.vs[ls.lst].next = null → gs.vtail = ls.lst)) ∧ ( listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns) ∧ ¬ dups(gs.orl + gs.qrl) ∧ markedp(gs.orl, gs.ps) ∧ markedp(gs.orl, gs.vs) ∧ unmarkedp(gs.qrl, gs.ps) ∧ gs.orl ≠ [] ∧ gs.phead ∈ gs.orl ∧ rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns) ∧ allocrv(gs.vretRefs, gs.vrvHp) ∧ nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs) ∧ rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns) ∧ allocrv(gs.pretRefs, gs.prvHp) ∧ dom gs.vrvHp = dom gs.prvHp ∧ ( gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val)) ∧ ( gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs)) ∧ ( gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[(gs.orl + gs.qrl).last].next = null)) ∧ (ls.node ∈ gs.ps ∧ ls.node ∈ gs.vs ∧ ls.node ≠ null ∧ ¬ ls.node ∈ gs.orl ∧ ¬ ls.node ∈ gs.qrl) ∧ gs.vs[ls.node] = mk(ls.value, None, null) ∧ gs.ps[ls.node] = gs.vs[ls.node] ∧ ¬ ls.success ∧ nextnottid(ls.tid, gs.vhead, gs.vs) ∧ noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs) ∧ oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps)) ∧ pre(gs, ls, E9, a) ∧ pcstepf(gs, ls, E9, a) = E10 → ( lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node)) ∧ ( listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs) ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps) ∧ gstepf(gs, ls, E9, a).orl ≠ [] ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl ∧ rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp) ∧ dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp ∧ ( gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs)) ∧ ( gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node]) ∧ nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) )

System applied rule normalize

And obtained the following new goals

Rule argument

Additional information

Proof step 2 from proof step-E9-E10 (previous step) (back to tree)

ls.nxt = null, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = gs.vs[ls.node], dom gs.vrvHp = dom gs.prvHp, pcstepf(gs, ls, E9, a) = E10, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), pre(gs, ls, E9, a), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), ls.lst ∈ gs.orl + gs.qrl, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.qrl, ¬ ls.node ∈ gs.orl, gs.vs[ls.lst].next = null → gs.vtail = ls.lst, 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 ⊦ ( lstepf(gs, ls, E9, a).success → gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node].val = lstepf(gs, ls, E9, a).value ∧ ( lstepf(gs, ls, E9, a).lst = gstepf(gs, ls, E9, a).vtail ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = null ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Weak(lstepf(gs, ls, E9, a).tid) ∨ lstepf(gs, ls, E9, a).lst ∈ gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next = lstepf(gs, ls, E9, a).node)) ∧ ( listp(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps, gstepf(gs, ls, E9, a).owns) ∧ ¬ dups(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).ps) ∧ markedp(gstepf(gs, ls, E9, a).orl, gstepf(gs, ls, E9, a).vs) ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).ps) ∧ gstepf(gs, ls, E9, a).orl ≠ [] ∧ gstepf(gs, ls, E9, a).phead ∈ gstepf(gs, ls, E9, a).orl ∧ rvownerok(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).vrvHp) ∧ nonullRetRefs (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).vretRefs, gstepf(gs, ls, E9, a).pretRefs) ∧ rvownerok(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp, gstepf(gs, ls, E9, a).rvowns) ∧ allocrv(gstepf(gs, ls, E9, a).pretRefs, gstepf(gs, ls, E9, a).prvHp) ∧ dom gstepf(gs, ls, E9, a).vrvHp = dom gstepf(gs, ls, E9, a).prvHp ∧ ( gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next ≠ null ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID ≠ None → gstepf(gs, ls, E9, a).rvowns (gstepf(gs, ls, E9, a).vretRefs(gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid)) = Claimed (gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].deqID.tid, gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).vhead].next].val)) ∧ ( gstepf(gs, ls, E9, a).orl.last = gstepf(gs, ls, E9, a).vhead ∧ (gstepf(gs, ls, E9, a).qrl ≠ [] → unmarkedp(gstepf(gs, ls, E9, a).qrl.tail, gstepf(gs, ls, E9, a).vs)) ∨ gstepf(gs, ls, E9, a).orl.butlast ≠ [] ∧ gstepf(gs, ls, E9, a).orl.butlast.last = gstepf(gs, ls, E9, a).vhead ∧ gstepf(gs, ls, E9, a).phead ≠ gstepf(gs, ls, E9, a).orl.last ∧ unmarkedp(gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vs)) ∧ ( gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last ∨ gstepf(gs, ls, E9, a).qrl ≠ [] ∧ gstepf(gs, ls, E9, a).vtail = (gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl.butlast).last ∧ gstepf(gs, ls, E9, a).vs[gstepf(gs, ls, E9, a).qrl.last].deqID = None ∧ gstepf(gs, ls, E9, a).vs[(gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl).last].next = null)) ∧ ( ¬ lstepf(gs, ls, E9, a).success → ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).orl ∧ ¬ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).qrl ∧ lstepf(gs, ls, E9, a).node ≠ null ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).ps ∧ lstepf(gs, ls, E9, a).node ∈ gstepf(gs, ls, E9, a).vs ∧ gstepf(gs, ls, E9, a).owns(lstepf(gs, ls, E9, a).node) = Some(lstepf(gs, ls, E9, a).tid) ∧ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node] = mk(lstepf(gs, ls, E9, a).value, None, null) ∧ gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).node] = gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).node]) ∧ nextnottid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ noid(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).orl + gstepf(gs, ls, E9, a).qrl, gstepf(gs, ls, E9, a).vhead, gstepf(gs, ls, E9, a).vs) ∧ (lstepf(gs, ls, E9, a).success ⊃ (gstepf(gs, ls, E9, a).ps[lstepf(gs, ls, E9, a).lst].next ≠ gstepf(gs, ls, E9, a).vs[lstepf(gs, ls, E9, a).lst].next ⊃ oneweakowns (lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) ;noowns(lstepf(gs, ls, E9, a).tid, gstepf(gs, ls, E9, a).owns) ) ;oneowns(lstepf(gs, ls, E9, a).tid, lstepf(gs, ls, E9, a).node, gstepf(gs, ls, E9, a).owns, gstepf(gs, ls, E9, a).vs, gstepf(gs, ls, E9, a).ps) )

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] fw-some-oneowns: ⊦ oneowns(tid, r0, owns, vs, ps) ∧ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → r = r0; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ ⊦ gstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]) .owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ); (s) ⊦ lstepf(gs, ls, E9, a) = ((gs.ps ⊕ gs.vs)[ls.lst].next = ls.nxt ⊃ ls.success:= true ;ls.success:= false ); (s) ⊦ y ≠ [] → (x + y).last = y.last; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ pre(gs, ls, E9, a) ↔ a = τ; (s) ⊦ pcstepf(gs, ls, E9, a) = E10; (s)

Proof step 3 from proof step-E9-E10 (previous step) (back to tree)

ls.nxt = null, gs.owns(ls.node) = Some(ls.tid), gs.vs[ls.node] = mk(ls.value, None, null), gs.ps[ls.node] = mk(ls.value, None, null), dom gs.vrvHp = dom gs.prvHp, ls.node ≠ null, gs.orl ≠ [], allocrv(gs.vretRefs, gs.vrvHp), allocrv(gs.pretRefs, gs.prvHp), listp(gs.orl + gs.qrl, gs.vs, gs.ps, gs.owns), markedp(gs.orl, gs.ps), markedp(gs.orl, gs.vs), nextnottid(ls.tid, gs.vhead, gs.vs), noid(ls.tid, gs.orl + gs.qrl, gs.vhead, gs.vs), nonullRetRefs(gs.orl + gs.qrl, gs.vs, gs.vretRefs, gs.pretRefs), oneowns(ls.tid, ls.node, gs.owns, gs.vs, gs.ps), rvownerok(gs.vretRefs, gs.vrvHp, gs.rvowns), rvownerok(gs.pretRefs, gs.prvHp, gs.rvowns), unmarkedp(gs.qrl, gs.ps), gs.phead ∈ gs.ps, gs.phead ∈ gs.vs, gs.phead ∈ gs.orl, ls.node ∈ gs.ps, ls.node ∈ gs.vs, ¬ ls.success, ¬ dups(gs.qrl), ¬ dups(gs.orl), ¬ dups(gs.orl + gs.qrl), ¬ ls.node ∈ gs.orl, ¬ ls.node ∈ gs.qrl, gs.vs[ls.lst].next = null → gs.vtail = ls.lst, gs.vs[gs.vhead].next ≠ null ∧ gs.vs[gs.vs[gs.vhead].next].deqID ≠ None → gs.rvowns(gs.vretRefs(gs.vs[gs.vs[gs.vhead].next].deqID.tid)) = Claimed(gs.vs[gs.vs[gs.vhead].next].deqID.tid, gs.vs[gs.vs[gs.vhead].next].val), gs.vtail = (gs.orl + gs.qrl).last ∨ gs.qrl ≠ [] ∧ gs.vtail = (gs.orl + gs.qrl.butlast).last ∧ gs.vs[gs.qrl.last].deqID = None ∧ gs.vs[gs.qrl.last].next = null, ls.lst ∈ gs.orl ∨ ls.lst ∈ gs.qrl, gs.orl.last = gs.vhead ∧ (gs.qrl ≠ [] → unmarkedp(gs.qrl.tail, gs.vs)) ∨ gs.orl.butlast ≠ [] ∧ gs.orl.butlast.last = gs.vhead ∧ gs.phead ≠ gs.orl.last ∧ unmarkedp(gs.qrl, gs.vs) ⊦ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] .val = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vtail ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .ps [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .owns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Weak(((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∨ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ) .orl ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid)) ;gs ) .qrl) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .ps [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node)) ∧ listp ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) ∧ ¬ dups ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ∧ markedp (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).phead ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ nonullRetRefs ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs) ∧ rvownerok (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns) ∧ allocrv (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).pretRefs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ dom ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vrvHp = dom ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).prvHp ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ] .next ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ] .next ] .deqID ≠ None → ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).rvowns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vretRefs (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ] .next ] .deqID .tid)) = Claimed (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ] .next ] .deqID .tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ] .next ] .val)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .last = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl ≠ [] → unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl .tail, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs)) ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .butlast ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .butlast .last = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vhead ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .phead ≠ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl .last ∧ unmarkedp (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs)) ∧ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vtail = ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ).last ∨ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ≠ [] ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .vtail = ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs) .qrl .butlast ).last ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .last ] .deqID = None ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl .last ] .next = null) ∧ ( ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl ∧ ¬ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Some(((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = mk(((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value, None, null) ∧ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ]) ∧ nextnottid (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ noid (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).orl + ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).qrl, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vhead, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs) ∧ (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success ⊃ ( ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ≠ ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs [((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ⊃ oneweakowns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) ;noowns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns) ) ;oneowns (((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).owns, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).vs, ((gs.ps ⊕ gs.vs)[ls.lst].next = null ⊃ (gs.vs:= gs.vs[ls.lst, gs.vs[ls.lst].next:= ls.node]).owns:= gs.owns(ls.node; Weak(ls.tid));gs).ps) )

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-E9-E10 (previous step) (back to tree)

ls.nxt = null, ps[ls.node] = mk(ls.value, None, null), vs[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, gs = mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), ls.node ∈ vs, ls.node ∈ ps, phead ∈ orl, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(qrl), ¬ dups(orl), ¬ dups(orl + qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[ls.lst].next = null → vtail = ls.lst, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), ls.lst ∈ orl ∨ ls.lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] .val = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Weak(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∨ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node)) ∧ listp ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl) ∧ markedp (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) ∧ markedp (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl ∧ rvownerok (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).rvowns) ∧ allocrv (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).rvowns) ∧ allocrv (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).pretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).prvHp) ∧ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vrvHp = dom ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).prvHp ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).rvowns (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vretRefs (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl.last = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl.tail, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs)) ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl.butlast ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl.butlast.last = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).phead ≠ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl.last ∧ unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs)) ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vtail = ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl ).last ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vtail = ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl.butlast ).last ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl.last ] .deqID = None ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl.last ] .next = null) ∧ ( ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl ∧ ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Some(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = mk(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value, None, null) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ]) ∧ nextnottid (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ noid (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs) ∧ (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success ⊃ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ≠ ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ⊃ oneweakowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) ;noowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns) ) ;oneowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ (gs.vs:= vs[ls.lst, vs[ls.lst].next:= ls.node]).owns:= owns(ls.node; Weak(ls.tid));gs).ps) )

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 ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .owns:= owns0 = mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns0, rvowns); (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) .vs:= ps2 = mkgs (ps, ps2, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns); (s)

Proof step 5 from proof step-E9-E10 (previous step) (back to tree)

ls.nxt = null, vs[ls.node] = mk(ls.value, None, null), ps[ls.node] = mk(ls.value, None, null), dom vrvHp = dom prvHp, owns(ls.node) = Some(ls.tid), ls.node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(ls.tid, vhead, vs), noid(ls.tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(ls.tid, ls.node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, ls.node ∈ ps, ls.node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ ls.success, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ ls.node ∈ orl, ¬ ls.node ∈ qrl, vs[ls.lst].next = null → vtail = ls.lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, ls.lst ∈ orl ∨ ls.lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] .val = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Weak(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∨ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node)) ∧ listp ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ( ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ¬ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Some(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = mk(((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).value, None, null) ∧ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node ]) ∧ nextnottid (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).success ⊃ ( ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ≠ ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ⊃ oneweakowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ;noowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ) ;oneowns (((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[ls.lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[ls.lst].next = null ⊃ mkgs (ps, vs[ls.lst, vs[ls.lst].next:= ls.node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(ls.node; Weak(ls.tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) )

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-E9-E10 (previous step) (back to tree)

ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, ls = mkls(tid, value, optval, node, nd, success, lst, nxt, rvref, optval0, first, othertid, addr), nxt = null, owns(node) = Some(tid), ¬ success, node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].next = null → vtail = lst, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∧ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] .val = ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).value ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst = ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Weak(((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∨ ( ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∨ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node)) ∧ listp ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ( ¬ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).success → ¬ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ¬ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ∧ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps ∧ ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node) = Some(((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = mk(((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).value, None, null) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ] = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node ]) ∧ nextnottid (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).success ⊃ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ≠ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).lst ] .next ⊃ oneweakowns (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ;noowns (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ) ;oneowns (((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).tid, ((ps ⊕ vs)[lst].next = null ⊃ ls.success:= true;ls.success:= false).node, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) .success:= success0 = mkls (tid, value, optval, node, nd, success0, node0, node1, rvref, optval0, node2, tid0, rvref0); (s)

Proof step 7 from proof step-E9-E10 (previous step) (back to tree)

vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success → ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] .val = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .value ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst = ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node) = Weak (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid) ∨ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node)) ∧ listp ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ∧ ¬ dups ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl) ∧ markedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ markedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ rvownerok (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp) ∧ nonullRetRefs ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs) ∧ rvownerok (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns) ∧ allocrv (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .pretRefs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp) ∧ dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vrvHp = dom ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .prvHp ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID ≠ None → ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .rvowns (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vretRefs (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid)) = Claimed (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .deqID .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ] .next ] .val)) ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] → unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .tail, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .butlast .last = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .phead ≠ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl .last ∧ unmarkedp (((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs)) ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ).last ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ≠ [] ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vtail = ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .butlast ).last ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .deqID = None ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl .last ] .next = null) ∧ ( ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success → ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl ∧ ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node) = Some (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] = mk (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .value, None, null) ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] = ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ]) ∧ nextnottid (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ noid (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .orl + ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .qrl, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vhead, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs) ∧ (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success ⊃ ( ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next ≠ ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next ⊃ oneweakowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) ;noowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns) ) ;oneowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .owns, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .vs, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) .ps) )

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:elim-mkgs, seq:⊦ ( ( ( ( ( ( ( ( ( ( (ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns), subst:[qrl, ps, phead, vrvHp, vretRefs, vhead, vtail, gs, owns, rvowns, orl, prvHp, pretRefs, vs] → [qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0]

Additional information

Used simplifier rules: ⊦ ( ( ( ( ( ( ( ( ( ((ps = gs.ps ∧ vs = gs.vs) ∧ phead = gs.phead) ∧ vhead = gs.vhead) ∧ vtail = gs.vtail) ∧ vretRefs = gs.vretRefs) ∧ pretRefs = gs.pretRefs) ∧ vrvHp = gs.vrvHp) ∧ prvHp = gs.prvHp) ∧ qrl = gs.qrl) ∧ orl = gs.orl) ∧ owns = gs.owns) ∧ rvowns = gs.rvowns ↔ gs = mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns); (elim) Used terms: qrl0, ps0, phead0, vrvHp0, vretRefs0, vhead0, vtail0, ((ps ⊕ vs)[lst].next = null ⊃ mkgs (ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs (ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ), owns0, rvowns0, orl0, prvHp0, pretRefs0, vs0

Proof step 8 from proof step-E9-E10 (previous step) (back to tree)

((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].next = null → vtail = lst, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success → vs0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ≠ null ∧ vs0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] .val = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .value ∧ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst = vtail0 ∧ ps0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = null ∧ owns0 (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node) = Weak (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid) ∨ ( ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ∈ orl0 ∨ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ∈ qrl0) ∧ ps0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next = ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node)) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ( ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success → ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ orl0 ∧ ¬ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ qrl0 ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ≠ null ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ ps0 ∧ ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ∈ vs0 ∧ owns0 (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node) = Some (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid) ∧ vs0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] = mk (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .value, None, null) ∧ ps0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ] = vs0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node ]) ∧ nextnottid (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, vhead0, vs0) ∧ noid (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, orl0 + qrl0, vhead0, vs0) ∧ (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .success ⊃ ( ps0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next ≠ vs0 [((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .lst ] .next ⊃ oneweakowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node, owns0, vs0, ps0) ;noowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, owns0) ) ;oneowns (((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .tid, ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) .node, owns0, vs0, ps0) )

User 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] → [value0, nxt, optval2, node0, nd0, ((ps ⊕ vs)[lst].next = null ⊃ mkls (tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls (tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ), addr0, tid0, lst0, first0, rvref0, othertid0, success, optval1]

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: value0, nxt, optval2, node0, nd0, ((ps ⊕ vs)[lst].next = null ⊃ mkls (tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls (tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ), addr0, tid0, lst0, first0, rvref0, othertid0, success, optval1

Proof step 9 from proof step-E9-E10 (previous step) (back to tree)

((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) = mkls(tid0, value0, optval1, node0, nd0, success, lst0, nxt, rvref0, optval2, first0, othertid0, addr0), vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( success → vs0[lst0].next = node0 ∧ node0 ≠ null ∧ vs0[node0].val = value0 ∧ (lst0 = vtail0 ∧ ps0[lst0].next = null ∧ owns0(node0) = Weak(tid0) ∨ (lst0 ∈ orl0 ∨ lst0 ∈ qrl0) ∧ ps0[lst0].next = node0)) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ( ¬ success → ¬ node0 ∈ orl0 ∧ ¬ node0 ∈ qrl0 ∧ node0 ≠ null ∧ node0 ∈ ps0 ∧ node0 ∈ vs0 ∧ owns0(node0) = Some(tid0) ∧ vs0[node0] = mk(value0, None, null) ∧ ps0[node0] = vs0[node0]) ∧ nextnottid(tid0, vhead0, vs0) ∧ noid(tid0, orl0 + qrl0, vhead0, vs0) ∧ (success ⊃ (ps0[lst0].next ≠ vs0[lst0].next ⊃ oneweakowns(tid0, node0, owns0, vs0, ps0);noowns(tid0, owns0)) ;oneowns(tid0, node0, owns0, vs0, ps0) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 10 from proof step-E9-E10 (previous step) (back to tree)

((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) = mkls(tid0, value0, optval1, node0, nd0, success, lst0, nxt, rvref0, optval2, first0, othertid0, addr0), ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ps[node] = mk(value, None, null), vs[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(pretRefs, prvHp), allocrv(vretRefs, vrvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, vs), markedp(orl, ps), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(pretRefs, prvHp, rvowns), rvownerok(vretRefs, vrvHp, rvowns), unmarkedp(qrl, ps), phead ∈ ps, phead ∈ vs, node ∈ vs, node ∈ ps, phead ∈ orl, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vs[lst].next = null → vtail = lst, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs), lst ∈ orl ∨ lst ∈ qrl, vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null ⊦ ( success → vs0[lst0].next = node0 ∧ vs0[lst0].next ≠ null ∧ vs0[vs0[lst0].next].val = value0 ∧ ( lst0 = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs0[vtail0].next) = Weak(tid0) ∨ (lst0 ∈ orl0 ∨ lst0 ∈ qrl0) ∧ ps0[lst0].next = vs0[lst0].next)) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ( ¬ success → ¬ node0 ∈ orl0 ∧ ¬ node0 ∈ qrl0 ∧ node0 ≠ null ∧ node0 ∈ ps0 ∧ node0 ∈ vs0 ∧ owns0(node0) = Some(tid0) ∧ vs0[node0] = mk(value0, None, null) ∧ ps0[node0] = vs0[node0]) ∧ nextnottid(tid0, vhead0, vs0) ∧ noid(tid0, orl0 + qrl0, vhead0, vs0) ∧ (success ⊃ (ps0[lst0].next ≠ vs0[lst0].next ⊃ oneweakowns(tid0, node0, owns0, vs0, ps0);noowns(tid0, owns0)) ;oneowns(tid0, node0, owns0, vs0, ps0) )

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: (ps ⊕ vs)[lst].next = null

Additional information

Used simplifier rules: ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) = mkls (tid1, value0, optval1, node3, nd0, success0, node4, node5, rvref1, optval2, node6, tid2, rvref2) ↔ tid = tid1 ∧ value = value0 ∧ optval = optval1 ∧ node = node3 ∧ nd = nd0 ∧ (success ↔ success0) ∧ node0 = node4 ∧ node1 = node5 ∧ rvref = rvref1 ∧ optval0 = optval2 ∧ node2 = node6 ∧ tid0 = tid2 ∧ rvref0 = rvref2; (ws) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws) ⊦ owns(r) = Some(tid) ∧ r ∈ ps ∧ r ∈ vs → ¬ oneweakowns(tid, r0, owns, vs, ps); (s) ⊦ owns(r) = Some(tid) → ¬ noowns(tid, owns); (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (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] Used formulas: (ps ⊕ vs)[lst].next = null

Proof step 11 from proof step-E9-E10 (previous step) (back to tree)

(ps ⊕ vs)[lst].next = null, ((ps ⊕ vs)[lst].next = null ⊃ mkgs(ps, vs[lst, vs[lst].next:= node], phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns(node; Weak(tid)), rvowns) ;mkgs(ps, vs, phead, vhead, vtail, vretRefs, pretRefs, vrvHp, prvHp, qrl, orl, owns, rvowns) ) = mkgs(ps0, vs0, phead0, vhead0, vtail0, vretRefs0, pretRefs0, vrvHp0, prvHp0, qrl0, orl0, owns0, rvowns0), ((ps ⊕ vs)[lst].next = null ⊃ mkls(tid, value, optval, node, nd, true, lst, null, rvref, optval0, first, othertid, addr) ;mkls(tid, value, optval, node, nd, false, lst, null, rvref, optval0, first, othertid, addr) ) = mkls(tid0, value0, optval1, node0, nd0, success, lst0, nxt, rvref0, optval2, first0, othertid0, addr0), vs[node] = mk(value, None, null), ps[node] = mk(value, None, null), dom vrvHp = dom prvHp, owns(node) = Some(tid), node ≠ null, orl ≠ [], allocrv(vretRefs, vrvHp), allocrv(pretRefs, prvHp), listp(orl + qrl, vs, ps, owns), markedp(orl, ps), markedp(orl, vs), nextnottid(tid, vhead, vs), noid(tid, orl + qrl, vhead, vs), nonullRetRefs(orl + qrl, vs, vretRefs, pretRefs), oneowns(tid, node, owns, vs, ps), rvownerok(vretRefs, vrvHp, rvowns), rvownerok(pretRefs, prvHp, rvowns), unmarkedp(qrl, ps), phead ∈ orl, node ∈ ps, node ∈ vs, phead ∈ vs, phead ∈ ps, ¬ dups(orl + qrl), ¬ dups(orl), ¬ dups(qrl), ¬ node ∈ orl, ¬ node ∈ qrl, vs[lst].next = null → vtail = lst, vs[vhead].next ≠ null ∧ vs[vs[vhead].next].deqID ≠ None → rvowns(vretRefs(vs[vs[vhead].next].deqID.tid)) = Claimed(vs[vs[vhead].next].deqID.tid, vs[vs[vhead].next].val), vtail = (orl + qrl).last ∨ qrl ≠ [] ∧ vtail = (orl + qrl.butlast).last ∧ vs[qrl.last].deqID = None ∧ vs[qrl.last].next = null, lst ∈ orl ∨ lst ∈ qrl, orl.last = vhead ∧ (qrl ≠ [] → unmarkedp(qrl.tail, vs)) ∨ orl.butlast ≠ [] ∧ orl.butlast.last = vhead ∧ phead ≠ orl.last ∧ unmarkedp(qrl, vs) ⊦ ( success → vs0[lst0].next = node0 ∧ vs0[lst0].next ≠ null ∧ vs0[vs0[lst0].next].val = value0 ∧ ( lst0 = vtail0 ∧ ps0[vtail0].next = null ∧ owns0(vs0[vtail0].next) = Weak(tid0) ∨ (lst0 ∈ orl0 ∨ lst0 ∈ qrl0) ∧ ps0[lst0].next = vs0[lst0].next)) ∧ listp(orl0 + qrl0, vs0, ps0, owns0) ∧ ¬ dups(orl0 + qrl0) ∧ markedp(orl0, ps0) ∧ markedp(orl0, vs0) ∧ unmarkedp(qrl0, ps0) ∧ orl0 ≠ [] ∧ phead0 ∈ orl0 ∧ rvownerok(vretRefs0, vrvHp0, rvowns0) ∧ allocrv(vretRefs0, vrvHp0) ∧ nonullRetRefs(orl0 + qrl0, vs0, vretRefs0, pretRefs0) ∧ rvownerok(pretRefs0, prvHp0, rvowns0) ∧ allocrv(pretRefs0, prvHp0) ∧ dom vrvHp0 = dom prvHp0 ∧ ( vs0[vhead0].next ≠ null ∧ vs0[vs0[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs0[vs0[vhead0].next].deqID.tid)) = Claimed(vs0[vs0[vhead0].next].deqID.tid, vs0[vs0[vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs0)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs0)) ∧ (vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs0[qrl0.last].deqID = None ∧ vs0[qrl0.last].next = null) ∧ ( ¬ success → ¬ node0 ∈ orl0 ∧ ¬ node0 ∈ qrl0 ∧ node0 ≠ null ∧ node0 ∈ ps0 ∧ node0 ∈ vs0 ∧ owns0(node0) = Some(tid0) ∧ vs0[node0] = mk(value0, None, null) ∧ ps0[node0] = vs0[node0]) ∧ nextnottid(tid0, vhead0, vs0) ∧ noid(tid0, orl0 + qrl0, vhead0, vs0) ∧ (success ⊃ (ps0[lst0].next ≠ vs0[lst0].next ⊃ oneweakowns(tid0, node0, owns0, vs0, ps0);noowns(tid0, owns0)) ;oneowns(tid0, node0, owns0, vs0, ps0) )

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 ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ Weak(tid) = Weak(tid0) ↔ tid = tid0; (s) ⊦ mkgs (ps, ps0, phead, phead0, phead1, vretRefs, vretRefs0, vrvHp, vrvHp0, qrl, qrl0, owns, rvowns) = mkgs (ps1, ps2, phead2, phead3, phead4, vretRefs1, vretRefs2, vrvHp1, vrvHp2, qrl1, qrl2, owns0, rvowns0) ↔ ps = ps1 ∧ ps0 = ps2 ∧ phead = phead2 ∧ phead0 = phead3 ∧ phead1 = phead4 ∧ vretRefs = vretRefs1 ∧ vretRefs0 = vretRefs2 ∧ vrvHp = vrvHp1 ∧ vrvHp0 = vrvHp2 ∧ qrl = qrl1 ∧ qrl0 = qrl2 ∧ owns = owns0 ∧ rvowns = rvowns0; (ws) ⊦ mkls (tid, value, optval, node, nd, success, node0, node1, rvref, optval0, node2, tid0, rvref0) = mkls (tid1, value0, optval1, node3, nd0, success0, node4, node5, rvref1, optval2, node6, tid2, rvref2) ↔ tid = tid1 ∧ value = value0 ∧ optval = optval1 ∧ node = node3 ∧ nd = nd0 ∧ (success ↔ success0) ∧ node0 = node4 ∧ node1 = node5 ∧ rvref = rvref1 ∧ optval0 = optval2 ∧ node2 = node6 ∧ tid0 = tid2 ∧ rvref0 = rvref2; (ws)

Proof step 12 from proof step-E9-E10 (previous step) (back to tree)

(ps0 ⊕ vs)[lst0].next = null, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, vs[lst0].next = null → vtail0 = lst0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vs[lst0, vs[lst0].next:= node0][node0].val = value0 ∧ (lst0 = vtail0 ∧ ps0[vtail0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].deqID = None ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

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] → [ps0, vs, lst0], <all paths>

Additional information

Used terms: ps0, vs, lst0

Proof step 13 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 14 from proof step-E9-E10 (previous step) (back to tree)

(lst0 ∈ vs ⊃ vs[lst0];ps0[lst0]).next = null, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst0].next = null → vtail0 = lst0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ vs[lst0, vs[lst0].next:= node0][node0].val = value0 ∧ (lst0 = vtail0 ∧ ps0[vtail0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].deqID = None ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

User applied rule apply lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps0, orl0 + qrl0, owns, lst0, vs

Proof step 15 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 16 from proof step-E9-E10 (previous step) (back to tree)

(lst0 ∈ vs ⊃ vs[lst0];ps0[lst0]).next = null, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, vs[lst0].next = null → vtail0 = lst0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns) ∧ lst0 ∈ orl0 + qrl0 → (∃ rl1, rl2. orl0 + qrl0 = rl1 + lst0 ' + rl2 ∧ listp(lst0 ' + rl2, vs, ps0, owns)), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ vs[lst0, vs[lst0].next:= node0][node0].val = value0 ∧ (lst0 = vtail0 ∧ ps0[vtail0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].deqID = None ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a ∈ b ' ↔ a = b; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s)

Proof step 17 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ' + rl2, (lst0 ∈ vs ⊃ vs[lst0];ps0[lst0]).next = null, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst0 ' + rl2, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node0 ∈ rl2, ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[lst0].next = null → vtail0 = lst0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ (lst0 = vtail0 ∧ ps0[vtail0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].deqID = None ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

User applied rule cut formula

And obtained the following new goals

Rule argument

fma: lst0 ∈ vs

Additional information

Used simplifier rules: ⊦ ¬ a ∈ st → st[a] = ∅[a]; (s) list-elem-in-app12: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app11: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ orl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] Used formulas: lst0 ∈ vs

Proof step 18 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ' + rl2, (lst0 ∈ vs ⊃ vs[lst0];ps0[lst0]).next = null, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(lst0 ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ node0 ∈ rl2, ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[lst0].next = null → vtail0 = lst0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ (lst0 = vtail0 ∧ ps0[vtail0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( vtail0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ vtail0 = (orl0 + qrl0.butlast).last ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].deqID = None ∧ vs[lst0, vs[lst0].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 19 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ' + rl2, vs[lst0].next = null, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(lst0 ' + rl2, vs, ps0, owns), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, ¬ node0 ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs) ⊦ (ps0[lst0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].deqID = None ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

User applied rule constructor cut

And obtained the following new goals

Rule argument

var: rl2

Additional information

Used simplifier rules: reflist freely generated by [], +;; ⊦ listp(r ' + r0 ' + rl, vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = vs[r].next ∧ ps[r].next = r0 ∧ listp(r0 ' + rl, vs, ps, owns); (s) ⊦ a + x = a ' + x; (s) ⊦ a ∈ b ' + x ↔ ¬(a ≠ b ∧ ¬ a ∈ x); (ss) notin-forward: ⊦ rl + rl0 = rl1 + rl2 + rl3 ∧ ¬ r ∈ rl ∧ ¬ r ∈ rl0 → ¬ r ∈ rl1 ∧ ¬ r ∈ rl2 ∧ ¬ r ∈ rl3; (forward) from specification DMSQ ⊦ ¬ listp(null ' + rl0, vs, ps, owns); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist]

Proof step 20 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ' + rl2, vs[lst0].next = null, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), rl2 = [], node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), listp(lst0 ' + rl2, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, ¬ node0 ∈ rl2, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ (ps0[lst0].next = null ∨ ps0[lst0].next = node0) ∧ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].deqID = None ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ (ps0[lst0].next ≠ node0 ⊃ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0) ;noowns(tid0, owns(ps0[lst0].next; Weak(tid0))) )

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) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ []; (s) ⊦ listp(r ', vs, ps, owns) ↔ owns(r) = None ∧ r ∈ vs ∧ r ∈ ps ∧ r ≠ null ∧ ¬ weak?(vs[r].deqID) ∧ (ps[r].deqID = vs[r].deqID ∨ ps[r].deqID = None) ∧ ps[r].val = vs[r].val ∧ ps[r].next = null ∧ ( vs[r].next ≠ null → vs[r].next ∈ vs ∧ vs[r].next ∈ ps ∧ ps[vs[r].next] = vs[vs[r].next] ∧ ps[vs[r].next].deqID = None ∧ ps[vs[r].next].next = null ∧ weak?(owns(vs[r].next))); (s) ⊦ x + [] = x; (s)

Proof step 21 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))) ∧ markedp(orl0, vs[lst0, vs[lst0].next:= node0]) ∧ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0) ∧ ( vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null ∧ vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) = Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val)) ∧ ( orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])) ∧ ( lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].deqID = None ∧ vs[(orl0 + qrl0.butlast).last, vs[(orl0 + qrl0.butlast).last].next:= node0][qrl0.last].next = null) ∧ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]) ∧ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0)

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ y ≠ [] → (x + y).last = y.last; (s) inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → st[b, d][a] = st[a]; (s)

Proof step 22 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:listp-venq, seq:⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next = null ∧ node ∈ vs ∧ node ∈ ps ∧ node ≠ null ∧ owns(node) = Some(tid) ∧ ps[node] = vs[node] ∧ vs[node].deqID = None ∧ vs[node].next = null → listp (rl, vs[rl.last, vs[rl.last].next:= node], ps, owns(node; Weak(tid))), subst:[ps, rl, node, tid, owns, vs] → [ps0, orl0 + qrl0, node0, tid0, owns, vs]

Additional information

Used terms: ps0, orl0 + qrl0, node0, tid0, owns, vs

Proof step 23 from proof step-E9-E10 (previous step) (back to tree)

⊦ listp(rl, vs, ps, owns) ∧ vs[rl.last].next = null ∧ node ∈ vs ∧ node ∈ ps ∧ node ≠ null ∧ owns(node) = Some(tid) ∧ ps[node] = vs[node] ∧ vs[node].deqID = None ∧ vs[node].next = null → listp(rl, vs[rl.last, vs[rl.last].next:= node], ps, owns(node; Weak(tid)))

A spec-lemma

Proof step 24 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), listp(orl0 + qrl0, vs, ps0, owns) ∧ vs[(orl0 + qrl0).last].next = null ∧ node0 ∈ vs ∧ node0 ∈ ps0 ∧ node0 ≠ null ∧ owns(node0) = Some(tid0) ∧ ps0[node0] = vs[node0] ∧ vs[node0].deqID = None ∧ vs[node0].next = null → listp(orl0 + qrl0, vs[(orl0 + qrl0).last, vs[(orl0 + qrl0).last].next:= node0], ps0, owns(node0; Weak(tid0))), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mk(val, opttid, nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s)

Proof step 25 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[(orl0 + qrl0).last].next = null → listp(orl0 + qrl0, vs[(orl0 + qrl0).last, vs[(orl0 + qrl0).last].next:= node0], ps0, owns(node0; Weak(tid0))), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

User 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] → [orl0, qrl0], <all paths>

Additional information

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

Proof step 26 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 27 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], qrl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, vs[qrl0.last].next = null → listp(orl0 + qrl0, vs[qrl0.last, vs[qrl0.last].next:= node0], ps0, owns(node0; Weak(tid0))), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = qrl0.last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] list-elem-in-app21: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ vs; (forward) from specification DMSQ list-elem-in-app22: ⊦ listp(orl + qrl, vs, ps, owns) ∧ node ∈ qrl → node ∈ ps; (forward) from specification DMSQ ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] inapp-12: ⊦ x + y = z + a ' ∧ b ∈ x ∧ y ≠ [] → b ∈ z; (forward) from specification list[reflist]

Proof step 28 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], qrl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ rl1, phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ qrl0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[qrl0.last].next = null → listp(orl0 + qrl0, vs[qrl0.last, vs[qrl0.last].next:= node0], ps0, owns(node0; Weak(tid0))), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, lst0 = qrl0.last ∨ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, orl0.last = vhead0 ∧ unmarkedp(qrl0.tail, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, 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] → [qrl0, phead, rl]

Additional information

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

Proof step 29 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), qrl0 = phead + rl, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], qrl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, lst0 ∈ qrl0, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ listp(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[qrl0.last].next = null → listp(orl0 + qrl0, vs[qrl0.last, vs[qrl0.last].next:= node0], ps0, owns(node0; Weak(tid0))), orl0.last = vhead0 ∧ unmarkedp(rl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 = qrl0.last ∨ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 30 from proof step-E9-E10 (previous step) (back to tree)

orl0 + phead ' + rl = rl1 + lst0 ', ps0[phead].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ phead, node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + lst0 ', vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, rl1 + lst0 ', vhead0, vs), nonullRetRefs(rl1 + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(rl, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, phead0 ∈ rl1, ¬ dups(rl), ¬ dups(orl0), ¬ dups(orl0 + rl), ¬ listp(rl1 + lst0 ', vs[lst0, vs[lst0].next:= node0], ps0, owns(node0; Weak(tid0))), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl, ¬ phead ∈ rl, ¬ phead ∈ orl0, ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, vs[(phead ' + rl).last].next = null → listp(rl1 + lst0 ', vs[(phead ' + rl).last, vs[(phead ' + rl).last].next:= node0], ps0, owns(node0; Weak(tid0))), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), orl0.last = vhead0 ∧ unmarkedp(rl, vs) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ vs[phead].deqID = None ∧ unmarkedp(rl, vs), lst0 = (phead ' + rl).last ∨ lst0 = (orl0 + (phead ' + rl).butlast).last ∧ vs[(phead ' + rl).last].deqID = None ∧ vs[(phead ' + rl).last].next = null, lst0 = phead ∨ lst0 ∈ rl, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User 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] → [phead ', rl], <all paths>

Additional information

Used simplifier rules: ⊦ x ≠ [] → (a ' + x).butlast = a ' + x.butlast; (s) ⊦ (x + a ' + y).last = (a ' + y).last; (s) in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ x + a ' ≠ []; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ (x + a ').last = a; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x + a ' = y + b ' ↔ x = y ∧ a = b; (ws) ⊦ ¬ dups([]); (s) ⊦ ¬ a ∈ []; (s) ⊦ unmarkedp([], vs); (s) ⊦ x + [] = x; (s) ⊦ a '.last = a; (s) Used terms: phead ', rl

Proof step 31 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 32 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ markedp(orl0, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:markedp-def, seq: ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)), subst:[rl, vs] → [orl0, vs], <all paths>

Additional information

Used terms: orl0, vs

Proof step 33 from proof step-E9-E10 (previous step) (back to tree)

⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))

A spec-lemma

Proof step 34 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ markedp(orl0, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ orl0 → some?(vs[r].deqID), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:markedp-def, seq: ⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID)), subst:[rl, vs] → [orl0, vs[lst0, vs[lst0].next:= node0]], <all paths>

Additional information

Used terms: orl0, vs[lst0, vs[lst0].next:= node0]

Proof step 35 from proof step-E9-E10 (previous step) (back to tree)

⊦ markedp(rl, vs) ↔ (∀ r. r ∈ rl → some?(vs[r].deqID))

A spec-lemma

Proof step 36 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ orl0 → some?(vs[r].deqID), ∃ r. ¬(r ∈ orl0 → some?(vs[lst0, vs[lst0].next:= node0][r].deqID)), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

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 37 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ orl0, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, r ∈ vs, r ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ some?(vs[lst0, vs[lst0].next:= node0][r].deqID), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ orl0 → some?(vs[r].deqID), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

User applied rule all left

And obtained the following new goals

Rule argument

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

Additional information

Used terms: r

Proof step 38 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), r ∈ ps0, r ∈ vs, phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, r ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ some?(vs[lst0, vs[lst0].next:= node0][r].deqID), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ orl0 → some?(vs[r].deqID), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 39 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[r].deqID), unmarkedp(qrl0, ps0), r ∈ orl0, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, r ∈ vs, r ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ some?(vs[lst0, vs[lst0].next:= node0][r].deqID), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, r], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst0, vs[lst0].next:= node0, r

Proof step 40 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 41 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ nonullRetRefs(orl0 + qrl0, vs[lst0, vs[lst0].next:= node0], vretRefs0, pretRefs0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ x ≠ [] → (x + y).head = x.head; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ nonullRetRefs(rl, vs, vretRefs, pretRefs) → ( nonullRetRefs(rl0, vs0, vretRefs0, pretRefs0) ↔ (∀ r. ( r ∈ rl ∧ r ≠ rl.head ∧ vs[r].deqID ≠ None → vretRefs(vs[r].deqID.tid) ≠ null ∧ pretRefs(vs[r].deqID.tid) ≠ null) → r ∈ rl0 ∧ r ≠ rl0.head ∧ vs0[r].deqID ≠ None → vretRefs0(vs0[r].deqID.tid) ≠ null ∧ pretRefs0(vs0[r].deqID.tid) ≠ null)); (ss)

Proof step 42 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[lst0, vs[lst0].next:= node0][r].deqID ≠ None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], r ≠ orl0.head, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, r ∈ orl0 ∨ r ∈ qrl0 ⊦ vretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null ∧ pretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null

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] → [orl0, phead, rl]

Additional information

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

Proof step 43 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, orl0 = phead + rl, owns(node0) = Some(tid0), owns(lst0) = None, vs[lst0, vs[lst0].next:= node0][r].deqID ≠ None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], r ≠ phead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ orl0 ∨ r ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦ vretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null ∧ pretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 44 from proof step-E9-E10 (previous step) (back to tree)

(phead ' + rl) + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[lst0, vs[lst0].next:= node0][r].deqID ≠ None, lst0 ≠ null, node0 ≠ phead, node0 ≠ null, node0 ≠ lst0, r ≠ phead, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, rl1 + lst0 ', vhead0, vs), nonullRetRefs(rl1 + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs[phead].deqID), unmarkedp(qrl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl + qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl, ¬ node0 ∈ qrl0, ¬ phead ∈ qrl0, ¬ phead ∈ rl, ¬ node0 ∈ rl1, vs[r].deqID ≠ None → vretRefs0(vs[r].deqID.tid) ≠ null ∧ pretRefs0(vs[r].deqID.tid) ≠ null, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), r ∈ rl ∨ r ∈ qrl0, (phead ' + rl).last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl ≠ [] ∧ (phead ' + rl.butlast).last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(qrl0, vs), phead0 = phead ∨ phead0 ∈ rl, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, phead ∈ rl1 ∨ phead = lst0, lst0 = phead ∨ lst0 ∈ rl ∨ lst0 ∈ qrl0 ⊦ vretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null ∧ pretRefs0(vs[lst0, vs[lst0].next:= node0][r].deqID.tid) ≠ null

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, r], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst0, vs[lst0].next:= node0, r

Proof step 45 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 46 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID ≠ None, vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid)) ≠ Claimed (vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].val), allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, vhead0], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ mk(val, opttid, nxt).val = val; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) Used terms: vs, lst0, vs[lst0].next:= node0, vhead0

Proof step 47 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 48 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID ≠ None, vs[vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID.tid)) ≠ Claimed(vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].val), vhead0 ≠ lst0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 49 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID ≠ None, vs[vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], rvowns0(vretRefs0(vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID.tid)) ≠ Claimed(vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID.tid, vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].val), vhead0 ≠ lst0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, vs[vhead0].next], <all paths>

Additional information

Used simplifier rules: ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).val = nd.val; (s) Used terms: vs, lst0, vs[lst0].next:= node0, vs[vhead0].next

Proof step 50 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 51 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦ orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])), orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])

User applied rule apply elim lemma

And obtained the following new goals

Rule argument

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

Additional information

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

Proof step 52 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, orl0 = rl + phead ', owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0]), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0]))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

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

Proof step 53 from proof step-E9-E10 (previous step) (back to tree)

(rl + phead ') + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ phead, node0 ≠ null, node0 ≠ lst0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(rl1 + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, rl1 + lst0 ', vhead0, vs), nonullRetRefs(rl1 + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[phead].deqID), some?(ps0[phead].deqID), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl + qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl, ¬ node0 ∈ qrl0, ¬ phead ∈ qrl0, ¬ phead ∈ rl, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (phead ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, phead0 ∈ rl ∨ phead0 = phead, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs), lst0 ∈ rl ∨ lst0 = phead ∨ lst0 ∈ qrl0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0]), phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0]))

User applied rule case distinction

And obtained the following new goals

Rule argument

pos: left 47

Additional information

Used simplifier rules: inapp-11: ⊦ x + y = z + a ' ∧ b ∈ x ∧ a ≠ b → b ∈ z; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ ¬ a ∈ x → (a ∈ b ' + x ↔ a = b); (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ a ∈ x → (b ' + x).last = x.last; (s) ⊦ x.last ∈ x ↔ x ≠ []; (s) in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s)

Proof step 54 from proof step-E9-E10 (previous step) (back to tree)

(rl + phead ') + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, phead = vhead0, lst0 ≠ null, node0 ≠ phead, node0 ≠ null, node0 ≠ lst0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(rl1 + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, rl1 + lst0 ', vhead0, vs), nonullRetRefs(rl1 + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[phead].deqID), some?(vs[phead].deqID), unmarkedp(qrl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(qrl0), ¬ dups(rl), ¬ dups(rl + qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl, ¬ node0 ∈ qrl0, ¬ phead ∈ qrl0, ¬ phead ∈ rl, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), qrl0 ≠ [] → unmarkedp(qrl0.tail, vs), lst0 ∈ rl ∨ lst0 = phead ∨ lst0 ∈ qrl0, ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, phead0 ∈ rl ∨ phead0 = phead, lst0 = (phead ' + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (phead ' + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦ phead = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs[lst0, vs[lst0].next:= node0])), rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ phead ∧ unmarkedp(qrl0, vs[lst0, vs[lst0].next:= node0])

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ≠ b → (a ∈ b ' + x ↔ a ∈ x); (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) a: ⊦ ¬ dups(x + y) → ¬ dups(x) ∧ ¬ dups(y); (forward) from specification list-dup[reflist] ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ unmarkedp(r ', vs) ↔ vs[r].deqID = None; (s) ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ unmarkedp(rl + rl0, vs) ↔ unmarkedp(rl, vs) ∧ unmarkedp(rl0, vs); (s) ⊦ (x + a ').last = a; (s) ⊦ ¬ b ∈ x → (dups(x + b ') ↔ dups(x)); (s) ⊦ dups(x + a ') ↔ a ∈ x ∨ dups(x); (ws) ⊦ a ∈ b ' ↔ a = b; (s) ⊦ x + a ' ≠ []; (s) ⊦ # y = # y0 → (x + y = z + y0 ↔ x = z ∧ y = y0); (ws) inex: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → (∃ z0. z = z0 + a '); (forward) from specification list[reflist] in-16: ⊦ x + a ' = y + b ' + z ∧ a ≠ b → a ∈ z; (forward) from specification list[reflist] ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) ⊦ x ≠ [] → (a ' + x).last = x.last; (s)

Proof step 55 from proof step-E9-E10 (previous step) (back to tree)

ps0[lst0].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ vhead0, lst0 ≠ null, node0 ≠ vhead0, node0 ≠ null, node0 ≠ lst0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(rl0, ps0), unmarkedp((rl0 + lst0 ').tail, vs), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ unmarkedp((rl0 + lst0 ').tail, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ lst0 ∈ rl0, ¬ lst0 ∈ rl, ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = vhead0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

Heuristic elimination applied rule apply elim lemma

And obtained the following new goals

Rule argument

spec: list-data[reflist], name:elim-list-c, seq:x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y, subst:[x, a, y] → [rl0 + lst0 ', phead, rl1]

Additional information

Used simplifier rules: ⊦ x + y = [] ↔ x = [] ∧ y = []; (as) ⊦ a ' ≠ []; (s) a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] x ≠ [] ⊦ a = x.head ∧ y = x.tail ↔ x = a + y; (elim) Used terms: rl0 + lst0 ', phead, y

Proof step 56 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead + rl1, ps0[lst0].deqID = None, vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, rl0 + lst0 ' ≠ [], lst0 ≠ vhead0, lst0 ≠ null, node0 ≠ vhead0, node0 ≠ null, node0 ≠ lst0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl1, vs), unmarkedp(rl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(rl0), ¬ dups(rl), ¬ dups(rl + rl0), ¬ unmarkedp(rl1, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ lst0 ∈ rl0, ¬ lst0 ∈ rl, ¬ node0 ∈ rl, ¬ node0 ∈ rl0, ¬ vhead0 ∈ rl0, ¬ vhead0 ∈ rl, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = vhead0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: a: ⊦ (x + y) + z = x + y + z; from specification list[reflist] ⊦ a ∈ b ' ↔ a = b; (s) ⊦ a ∈ x + y ↔ a ∈ x ∨ a ∈ y; (s) ni: ⊦ x + a ' = y + z ∧ ¬ a ∈ z → z = []; (forward) from specification list[reflist] ⊦ ¬ node ∈ rl → (unmarkedp(rl, vs[node, nd]) ↔ unmarkedp(rl, vs)); (s) ⊦ a ∈ b ' + x ↔ a = b ∨ a ∈ x; (s) in-14: ⊦ a ' + x = y → a ∈ y; (forward) from specification list[reflist] in-15: ⊦ x + a ' = y → a ∈ y; (forward) from specification list[reflist] ⊦ x + a ' ≠ []; (s) ⊦ a + x = a ' + x; (s)

Proof step 57 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl1, vs), unmarkedp(rl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, lst0 ∈ rl1, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ unmarkedp(rl1, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), phead0 ∈ rl ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = lst0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:unmarkedp-def, seq: ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None), subst:[rl, vs] → [rl1, vs], <all paths>

Additional information

Used terms: rl1, vs

Proof step 58 from proof step-E9-E10 (previous step) (back to tree)

⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)

A spec-lemma

Proof step 59 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(rl0, ps0), lst0 ∈ rl1, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ unmarkedp(rl1, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = lst0, phead0 ∈ rl ∨ phead0 = vhead0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:unmarkedp-def, seq: ⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None), subst:[rl, vs] → [rl1, vs[lst0, vs[lst0].next:= node0]], <all paths>

Additional information

Used terms: rl1, vs[lst0, vs[lst0].next:= node0]

Proof step 60 from proof step-E9-E10 (previous step) (back to tree)

⊦ unmarkedp(rl, vs) ↔ (∀ r. r ∈ rl → vs[r].deqID = None)

A spec-lemma

Proof step 61 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, lst0 ∈ rl1, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, ∃ r. ¬(r ∈ rl1 → vs[lst0, vs[lst0].next:= node0][r].deqID = None), phead0 ∈ rl ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = lst0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 62 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[lst0, vs[lst0].next:= node0][r].deqID ≠ None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(rl0, ps0), r ∈ rl1, lst0 ∈ rl1, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = lst0, phead0 ∈ rl ∨ phead0 = vhead0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, r], <all paths>

Additional information

Used terms: vs, lst0, vs[lst0].next:= node0, r

Proof step 63 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 64 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, r = lst0, vs[lst0, vs[lst0].next:= node0][r].deqID ≠ None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, lst0 ∈ rl1, r ∈ rl1, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead0 ∈ rl ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = lst0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) ⊦ a = b → st[b, d][a] = d; (s)

Proof step 65 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[lst0].deqID ≠ None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(rl0, ps0), lst0 ∈ rl1, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = lst0, phead0 ∈ rl ∨ phead0 = vhead0 ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 49 terms: lst0

Additional information

Used terms: lst0

Proof step 66 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[r].deqID ≠ None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, r ≠ lst0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, ps0), markedp(rl, vs), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), some?(ps0[vhead0].deqID), some?(vs[vhead0].deqID), unmarkedp(rl0, ps0), node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, lst0 ∈ rl1, r ∈ rl1, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead0 ∈ rl ∨ phead0 = vhead0, phead ∈ rl0 ∨ phead = lst0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

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] inapp-13: ⊦ a ' + x = y + b ' ∧ c ∈ x ∧ c ≠ b → c ∈ y; (forward) from specification list[reflist]

Proof step 67 from proof step-E9-E10 (previous step) (back to tree)

rl0 + lst0 ' = phead ' + rl1, ps0[lst0].deqID = None, ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[r].deqID ≠ None, lst0 ≠ null, lst0 ≠ vhead0, node0 ≠ lst0, node0 ≠ null, node0 ≠ vhead0, r ≠ lst0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp((rl + vhead0 ' + rl0) + lst0 ', vs, ps0, owns), markedp(rl, vs), markedp(rl, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, (rl + vhead0 ' + rl0) + lst0 ', vhead0, vs), nonullRetRefs((rl + vhead0 ' + rl0) + lst0 ', vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), some?(vs[vhead0].deqID), some?(ps0[vhead0].deqID), unmarkedp(rl0, ps0), r ∈ rl1, lst0 ∈ rl1, lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, r ∈ rl0, ¬ dups(rl + rl0), ¬ dups(rl), ¬ dups(rl0), ¬ weak?(vs[lst0].deqID), ¬ vhead0 ∈ rl, ¬ vhead0 ∈ rl0, ¬ node0 ∈ rl0, ¬ node0 ∈ rl, ¬ lst0 ∈ rl, ¬ lst0 ∈ rl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r. r ∈ rl1 → vs[r].deqID = None, phead ∈ rl0 ∨ phead = lst0, phead0 ∈ rl ∨ phead0 = vhead0 ⊦ rl ≠ [] ∧ rl.last = vhead0 ∧ phead0 ≠ rl.last ∧ unmarkedp(rl0, vs) ∧ vs[lst0].deqID = None

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 52 terms: r

Additional information

Used terms: r

Proof step 68 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

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] → [tid0, vhead0, vs], <all paths>

Additional information

Used terms: tid0, vhead0, vs

Proof step 69 from proof step-E9-E10 (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 70 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ nextnottid(tid0, vhead0, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

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] → [tid0, vhead0, vs[lst0, vs[lst0].next:= node0]], <all paths>

Additional information

Used terms: tid0, vhead0, vs[lst0, vs[lst0].next:= node0]

Proof step 71 from proof step-E9-E10 (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 72 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0, vs[lst0].next:= node0][vs[lst0, vs[lst0].next:= node0][vhead0].next].deqID = Some(tid0), vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[lst0, vs[lst0].next:= node0][vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, vhead0], <all paths>

Additional information

Used simplifier rules: ⊦ a ≠ b → st[b, d][a] = st[a]; (s) ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).next = nxt; (s) ⊦ mk(val, opttid, nxt).deqID = opttid; (s) ⊦ None ≠ Some(tid); (s) Used terms: vs, lst0, vs[lst0].next:= node0, vhead0

Proof step 73 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 74 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID = Some(tid0), ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), vs[vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], vhead0 ≠ lst0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), vs[vhead0].next ≠ null → vs[vs[vhead0].next].deqID ≠ Some(tid0), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 75 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0, vs[lst0].next:= node0][vs[vhead0].next].deqID = Some(tid0), vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[vs[vhead0].next].deqID ≠ Some(tid0), vs[vhead0].next ≠ null, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], vhead0 ≠ lst0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, vs[vhead0].next], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst0, vs[lst0].next:= node0, vs[vhead0].next

Proof step 76 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 77 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ noid(tid0, orl0 + qrl0, vhead0, vs[lst0, vs[lst0].next:= node0]), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:noid-reduce, seq:⊦ noid(tid, rl, r, vs) → ( noid(tid, rl0, r, vs0) ↔ (∀ r0. (r0 ≠ r ∧ r0 ∈ rl from r → vs[r0].deqID ≠ Some(tid)) → r0 ≠ r ∧ r0 ∈ rl0 from r → vs0[r0].deqID ≠ Some(tid))), subst:[rl, tid, r, vs0, rl0, vs] → [orl0 + qrl0, tid0, vhead0, vs[lst0, vs[lst0].next:= node0], orl0 + qrl0, vs], <all paths>

Additional information

Used terms: orl0 + qrl0, tid0, vhead0, vs[lst0, vs[lst0].next:= node0], orl0 + qrl0, vs

Proof step 78 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 79 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∃ r0. ¬ ( (r0 ≠ vhead0 ∧ r0 ∈ orl0 + qrl0 from vhead0 → vs[r0].deqID ≠ Some(tid0)) → r0 ≠ vhead0 ∧ r0 ∈ orl0 + qrl0 from vhead0 → vs[lst0, vs[lst0].next:= node0][r0].deqID ≠ Some(tid0)), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Proof step 80 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0, vs[lst0].next:= node0][r0].deqID = Some(tid0), vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, vs[r0].deqID ≠ Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], r0 ≠ vhead0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), r0 ∈ orl0 + qrl0 from vhead0, phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: store[Node-heap], name:At-other, seq: ⊦ a ≠ b → st[b, d][a] = st[a], subst:[st, b, d, a] → [vs, lst0, vs[lst0].next:= node0, r0], <all paths>

Additional information

Used simplifier rules: ⊦ a = b → st[b, d][a] = d; (s) ⊦ (nd.next:= nxt).deqID = nd.deqID; (s) Used terms: vs, lst0, vs[lst0].next:= node0, r0

Proof step 81 from proof step-E9-E10 (previous step) (back to tree)

⊦ a ≠ b → st[b, d][a] = st[a]

A spec-lemma

Proof step 82 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(tid0), owns(lst0) = None, lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, node0 ∈ ps0, node0 ∈ vs, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ oneweakowns(tid0, node0, owns(node0; Weak(tid0)), vs[lst0, vs[lst0].next:= node0], ps0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

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

Additional information

Used terms: ps0, tid0, owns(node0; Weak(tid0)), node0, vs[lst0, vs[lst0].next:= node0]

Proof step 83 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 84 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(tid0), lst0 ≠ null, node0 ≠ lst0, node0 ≠ null, orl0 ≠ [], allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(tid0, vhead0, vs), noid(tid0, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(tid0, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(orl0 + qrl0), ¬ dups(orl0), ¬ dups(qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ qrl0, ¬ node0 ∈ orl0, ¬ node0 ∈ rl1, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, ¬ node0 ∈ vs[lst0, vs[lst0].next:= node0] ∨ ¬ node0 ∈ ps0 ∨ owns(node0; Weak(tid0))(node0) ≠ Weak(tid0) ∨ (∃ r0. ¬(r0 ≠ node0 ∧ owns(node0; Weak(tid0))(r0) ≠ None → owns(node0; Weak(tid0))(r0).tid ≠ tid0)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ Weak(tid) = Weak(tid0) ↔ tid = tid0; (s) ⊦ a ≠ b → (a ∈ st[b, d] ↔ a ∈ st); (s)

Proof step 85 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', ps0[lst0].next = null, vs[lst0].next = null, ps0[lst0].val = vs[lst0].val, ps0[node0] = mk(value0, None, null), vs[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(lst0) = None, owns(node0) = Some(owns(r0).tid), lst0 ≠ null, node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], owns(r0) ≠ None, r0 ≠ node0, allocrv(pretRefs0, prvHp0), allocrv(vretRefs0, vrvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, vs), markedp(orl0, ps0), nextnottid(owns(r0).tid, vhead0, vs), noid(owns(r0).tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), oneowns(owns(r0).tid, node0, owns, vs, ps0), rvownerok(pretRefs0, prvHp0, rvowns0), rvownerok(vretRefs0, vrvHp0, rvowns0), unmarkedp(qrl0, ps0), lst0 ∈ ps0, lst0 ∈ vs, phead0 ∈ ps0, phead0 ∈ vs, node0 ∈ vs, node0 ∈ ps0, phead0 ∈ orl0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), lst0 ∈ orl0 ∨ lst0 ∈ qrl0, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null ⊦

User applied rule apply rewrite lemma

And obtained the following new goals

Rule argument

spec: DMSQ, name:oneowns-def, seq:⊦ oneowns(tid, r, owns, vs, ps) ↔ r ∈ vs ∧ r ∈ ps ∧ owns(r) = Some(tid) ∧ (∀ r0. r0 ≠ r ∧ owns(r0) ≠ None → owns(r0).tid ≠ tid), subst:[ps, tid, owns, r, vs] → [ps0, owns(r0).tid, owns, node0, vs], <all paths>

Additional information

Used terms: ps0, owns(r0).tid, owns, node0, vs

Proof step 86 from proof step-E9-E10 (previous step) (back to tree)

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

A spec-lemma

Proof step 87 from proof step-E9-E10 (previous step) (back to tree)

orl0 + qrl0 = rl1 + lst0 ', vs[lst0].next = null, ps0[lst0].next = null, ps0[lst0].val = vs[lst0].val, vs[node0] = mk(value0, None, null), ps0[node0] = mk(value0, None, null), dom vrvHp0 = dom prvHp0, owns(node0) = Some(owns(r0).tid), owns(lst0) = None, lst0 ≠ null, node0 ≠ null, node0 ≠ lst0, orl0 ≠ [], owns(r0) ≠ None, r0 ≠ node0, allocrv(vretRefs0, vrvHp0), allocrv(pretRefs0, prvHp0), listp(orl0 + qrl0, vs, ps0, owns), markedp(orl0, ps0), markedp(orl0, vs), nextnottid(owns(r0).tid, vhead0, vs), noid(owns(r0).tid, orl0 + qrl0, vhead0, vs), nonullRetRefs(orl0 + qrl0, vs, vretRefs0, pretRefs0), rvownerok(vretRefs0, vrvHp0, rvowns0), rvownerok(pretRefs0, prvHp0, rvowns0), unmarkedp(qrl0, ps0), phead0 ∈ orl0, phead0 ∈ vs, phead0 ∈ ps0, lst0 ∈ vs, lst0 ∈ ps0, node0 ∈ vs, node0 ∈ ps0, ¬ dups(qrl0), ¬ dups(orl0), ¬ dups(orl0 + qrl0), ¬ weak?(vs[lst0].deqID), ¬ node0 ∈ rl1, ¬ node0 ∈ orl0, ¬ node0 ∈ qrl0, vs[vhead0].next ≠ null ∧ vs[vs[vhead0].next].deqID ≠ None → rvowns0(vretRefs0(vs[vs[vhead0].next].deqID.tid)) = Claimed(vs[vs[vhead0].next].deqID.tid, vs[vs[vhead0].next].val), ∀ r1. r1 ≠ node0 ∧ owns(r1) ≠ None → owns(r1).tid ≠ owns(r0).tid, lst0 = (orl0 + qrl0).last ∨ qrl0 ≠ [] ∧ lst0 = (orl0 + qrl0.butlast).last ∧ vs[qrl0.last].deqID = None ∧ vs[qrl0.last].next = null, lst0 ∈ orl0 ∨ lst0 ∈ qrl0, orl0.last = vhead0 ∧ (qrl0 ≠ [] → unmarkedp(qrl0.tail, vs)) ∨ orl0.butlast ≠ [] ∧ orl0.butlast.last = vhead0 ∧ phead0 ≠ orl0.last ∧ unmarkedp(qrl0, vs), ps0[lst0].deqID = vs[lst0].deqID ∨ ps0[lst0].deqID = None ⊦

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 42 terms: r0

Additional information

Used terms: r0

Proof Tree for step-E9-E10 (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